ABACUS: Mining Arbitrary Shaped Clusters from Large Datasets based on Backbone Identification
暂无分享,去创建一个
Geng Li | Mohammed J. Zaki | Vineet Chaoji | Hilmi Yildirim | Vineet Chaoji | Geng Li | Hilmi Yildirim
[1] Yong Shi,et al. A Shrinking-Based Approach for Multi-Dimensional Data Analysis , 2003, VLDB.
[2] Paul S. Bradley,et al. Scaling Clustering Algorithms to Large Databases , 1998, KDD.
[3] Daniel A. Keim,et al. An Efficient Approach to Clustering in Large Multimedia Databases with Noise , 1998, KDD.
[4] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[5] Jiawei Han,et al. CLARANS: A Method for Clustering Objects for Spatial Data Mining , 2002, IEEE Trans. Knowl. Data Eng..
[6] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[7] Hans-Peter Kriegel,et al. Data bubbles: quality preserving performance boosting for hierarchical clustering , 2001, SIGMOD '01.
[8] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[9] Jitendra Malik,et al. Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[10] Ling Huang,et al. Fast approximate spectral clustering , 2009, KDD.
[11] Mohammad Al Hasan,et al. SPARCL: Efficient and Effective Shape-Based Clustering , 2008, 2008 Eighth IEEE International Conference on Data Mining.
[12] Vipin Kumar,et al. Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.
[13] Yizong Cheng,et al. Mean Shift, Mode Seeking, and Clustering , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[14] Vipin Kumar,et al. Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data , 2003, SDM.
[15] Setsuo Ohsuga,et al. INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .