Sciweavers

58 search results - page 5 / 12
» kdd 2012
Sort
View
KDD
2012
ACM
183views Data Mining» more  KDD 2012»
13 years 15 days ago
Mining discriminative components with low-rank and sparsity constraints for face recognition
This paper introduces a novel image decomposition approach for an ensemble of correlated images, using low-rank and sparsity constraints. Each image is decomposed as a combination...
Qiang Zhang, Baoxin Li
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 15 days ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 15 days ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
97
Voted
KDD
2012
ACM
188views Data Mining» more  KDD 2012»
13 years 15 days ago
A probabilistic model for multimodal hash function learning
In recent years, both hashing-based similarity search and multimodal similarity search have aroused much research interest in the data mining and other communities. While hashing-...
Yi Zhen, Dit-Yan Yeung
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
13 years 15 days 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