138 search results - page 15 / 28 » Information Theoretic Clustering of Sparse Co-Occurrence Dat... |
NIPS
2007
13 years 9 months ago
2007
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
ICML
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
WAIM
2005
Springer
14 years 1 months ago
2005
Springer
Researchers from the same lab often spend a considerable amount of time searching for published articles relevant to their current project. Despite having similar interests, they c...