502 search results - page 47 / 101 » Sparse Subspace Clustering |
211
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Subspace clustering has attracted great attention due to its capability of finding salient patterns in high dimensional data. Order preserving subspace clusters have been proven to...
124
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
126
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
136
click to vote
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
In the past few years there has been increased research interest in detecting previously unidentified events from Web resources. Our focus in this paper is to detect events from ...
103
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...