Sciweavers

294 search results - page 4 / 59
» Optimized fixed-size kernel models for large data sets
Sort
View
DATAMINE
2006
166views more  DATAMINE 2006»
13 years 7 months ago
Accelerated EM-based clustering of large data sets
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
Jakob J. Verbeek, Jan Nunnink, Nikos A. Vlassis
ICDM
2003
IEEE
100views Data Mining» more  ICDM 2003»
14 years 20 days ago
Tractable Group Detection on Large Link Data Sets
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
Jeremy Kubica, Andrew W. Moore, Jeff G. Schneider
SDM
2009
SIAM
215views Data Mining» more  SDM 2009»
14 years 4 months ago
Hybrid Clustering of Text Mining and Bibliometrics Applied to Journal Sets.
To obtain correlated and complementary information contained in text mining and bibliometrics, hybrid clustering to incorporate textual content and citation information has become...
Bart De Moor, Frizo A. L. Janssens, Shi Yu, Wolfga...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
PAMI
2012
11 years 9 months ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens