loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Pattern Recognition (ICPR'06) Volume 1
A K-means-based Algorithm for Projective Clustering
Hong Kong
August 20-August 24
ISBN: 0-7695-2521-0
Mohamed Bouguessa, University of Sherbrooke, Canada
Shengrui Wang, Xiamen University, Fujian 361005, China
Qingshan Jiang, Xiamen University, Fujian 361005, China
In this paper, a new algorithm for projective clustering is proposed. The algorithm consists of two phases. The first phase performs attribute relevance analysis by detecting dense regions in each attribute, thereby allowing irrelevant attributes and outliers to be captured and eliminated. Starting from the results of the first phase, the second phase aims to uncover clusters in different subspaces. The clustering process is based on the k-means algorithm, with the computation of distance restricted to subsets of attributes where object values are dense.
Citation:
Mohamed Bouguessa, Shengrui Wang, Qingshan Jiang, "A K-means-based Algorithm for Projective Clustering," icpr, vol. 1, pp.888-891, 18th International Conference on Pattern Recognition (ICPR'06) Volume 1, 2006
Usage of this product signifies your acceptance of the Terms of Use.