Sciweavers

4843 search results - page 778 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
183
Voted
JMLR
2012
13 years 6 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 5 months ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
CVPR
2008
IEEE
16 years 5 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
16 years 4 months ago
Efficient Detection of Distributed Constraint Violations
In many distributed environments, the primary function of monitoring software is to detect anomalies, that is, instances when system behavior deviates substantially from the norm....
Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Raje...
225
Voted
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 4 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti