Sciweavers

13 search results - page 2 / 3
» Robust Subspace Clustering by Combined Use of kNND Metric an...
Sort
View
ICA
2004
Springer
13 years 9 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
ICDM
2007
IEEE
170views Data Mining» more  ICDM 2007»
13 years 10 months ago
Consensus Clusterings
In this paper we address the problem of combining multiple clusterings without access to the underlying features of the data. This process is known in the literature as clustering...
Nam Nguyen, Rich Caruana
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
14 years 4 months ago
Query result clustering for object-level search
Query result clustering has recently attracted a lot of attention to provide users with a succinct overview of relevant results. However, little work has been done on organizing t...
Jongwuk Lee, Seung-won Hwang, Zaiqing Nie, Ji-Rong...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 4 months ago
Robust information-theoretic clustering
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...
Christian Böhm, Christos Faloutsos, Claudia P...
CIKM
2009
Springer
13 years 8 months ago
Density-based clustering using graphics processors
During the last few years, GPUs have evolved from simple devices for the display signal preparation into powerful coprocessors that do not only support typical computer graphics t...
Christian Böhm, Robert Noll, Claudia Plant, B...