436 search results - page 24 / 88 » Automatic Subspace Clustering of High Dimensional Data for D... |
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Semi-supervised clustering models, that incorporate user provided constraints to yield meaningful clusters, have recently become a popular area of research. In this paper...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
Since clustering is unsupervised and highly explorative, clustering validation (i.e. assessing the quality of clustering solutions) has been an important and long standing researc...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Tools for automatically clustering streaming data are becoming increasingly important as data acquisition technology continues to advance. In this paper we present an extension of...