Finding Dense Clusters in Hyperspace: An Approach Based on Row Shuffling
暂无分享,去创建一个
[1] Daniel A. Keim,et al. Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering , 1999, VLDB.
[2] Piotr Indyk. Dimensionality reduction techniques for proximity problems , 2000, SODA '00.
[3] Jiong Yang,et al. STING: A Statistical Information Grid Approach to Spatial Data Mining , 1997, VLDB.
[4] Xintao Wu,et al. Using Loglinear Models to Compress Datacube , 2000, Web-Age Information Management.
[5] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[6] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[7] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[8] Paul S. Bradley,et al. Scaling Clustering Algorithms to Large Databases , 1998, KDD.
[9] Xintao Wu,et al. Using approximations to scale exploratory data analysis in datacubes , 1999, KDD '99.
[10] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.