Sciweavers

766 search results - page 9 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
EGITALY
2006
13 years 10 months ago
3D Data Segmentation Using a Non-Parametric Density Estimation Approach
In this paper, a new segmentation approach for sets of 3D unorganized points is proposed. The method is based on a clustering procedure that separates the modes of a non-parametri...
Umberto Castellani, Marco Cristani, Vittorio Murin...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 2 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 10 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
CVPR
2004
IEEE
14 years 10 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
ACMSE
2010
ACM
13 years 6 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