论文信息 - Subspace clustering for high dimensional data

Subspace clustering for high dimensional data

Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. Often in high dimensional data, many dimensions are irrelevant and...

LiuHuan | ParsonsLance | HaqueEhtesham

[1] Michalis Vazirgiannis,et al. Cluster validity methods: part I , 2002, SGMD.

[2] Philip S. Yu,et al. /spl delta/-clusters: capturing subspace correlation in a large data set , 2002, Proceedings 18th International Conference on Data Engineering.

[3] Jianhong Wu,et al. Projective ART for clustering data sets in high dimensional spaces , 2002, Neural Networks.

[4] Luis Talavera. Dynamic Feature Selection in Incremental Hierarchical Clustering , 2000, ECML.

[5] Huan Liu,et al. Feature Selection for Clustering , 2000, Encyclopedia of Database Systems.

[6] T. Kohonen,et al. Exploratory Data Analysis by the Self-Organizing Map: Structures of Welfare and Poverty in the World , 1996 .

[7] Dimitris Achlioptas,et al. Database-friendly random projections , 2001, PODS.

[8] Andrew McCallum,et al. Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.

[9] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.