502 search results - page 50 / 101 » Sparse Subspace Clustering |
149
click to vote
ALGORITHMICA
1999
15 years 3 months ago
1999
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
142
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
115
click to vote
WWW
2010
ACM
15 years 10 months ago
2010
ACM
We present two modifications to the popular k-means clustering algorithm to address the extreme requirements for latency, scalability, and sparsity encountered in user-facing web...
139
click to vote
CIS
2005
Springer
15 years 9 months ago
2005
Springer
Different from familiar clustering objects, text documents have sparse data spaces. A common way of representing a document is as a bag of its component words, but the semantic re...
116
click to vote
AAAI
2007
15 years 6 months ago
2007
Clustering is an old research topic in data mining and machine learning communities. Most of the traditional clustering methods can be categorized local or global ones. In this pa...