Sciweavers

190 search results - page 1 / 38
» Constraint-Based Subspace Clustering.
Sort
View
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 2 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...
ACMSE
2010
ACM
13 years 2 months ago
Mining relaxed closed subspace clusters
This paper defines and discusses a new problem in the area of subspace clustering. It defines the problem of mining closed subspace clusters. This new concept allows for the culli...
Erich Allen Peterson, Peiyi Tang
DASFAA
2007
IEEE
199views Database» more  DASFAA 2007»
13 years 11 months ago
Detection and Visualization of Subspace Cluster Hierarchies
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
JMLR
2012
11 years 7 months ago
High-Rank Matrix Completion
This paper considers the problem of completing a matrix with many missing entries under the assumption that the columns of the matrix belong to a union of multiple low-rank subspa...
Brian Eriksson, Laura Balzano, Robert Nowak
CVPR
2004
IEEE
14 years 6 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade