OPTICS: ordering points to identify the clustering structure
暂无分享,去创建一个
Hans-Peter Kriegel | Mihael Ankerst | Markus M. Breunig | Jörg Sander | M. Ankerst | M. Breunig | H. Kriegel | J. Sander
[1] John A. Richards,et al. Remote Sensing Digital Image Analysis , 1986 .
[2] Jiawei Han,et al. Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.
[3] Erich Schikuta,et al. Grid-clustering: an efficient hierarchical clustering method for very large data sets , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[4] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[5] Hans-Peter Kriegel,et al. 'Circle Segments': A Technique for Visually Exploring Large Multidimensional Data Sets , 1996 .
[6] Daniel A. Keim,et al. Pixel-oriented database visualizations , 1996, SGMD.
[7] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[8] William H. Press,et al. Numerical Recipes in C, 2nd Edition , 1992 .
[9] Hans-Peter Kriegel,et al. Knowledge Discovery in Large Spatial Databases: Focusing Techniques for Efficient Class Identification , 1995, SSD.
[10] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[11] Ali S. Hadi,et al. Finding Groups in Data: An Introduction to Chster Analysis , 1991 .
[12] William H. Press,et al. Numerical recipes , 1990 .
[13] Daniel A. Keim,et al. databases and visualization , 1996, SIGMOD '96.
[14] Raymond T. Ng,et al. Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining , 1996, IEEE Trans. Knowl. Data Eng..
[15] Robin Sibson,et al. SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..
[16] Dimitrios Gunopulos,et al. Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.
[17] Kazuo Hattori,et al. Effective algorithms for the nearest neighbor method in the clustering problem , 1993, Pattern Recognit..
[18] William H. Press,et al. Numerical recipes in C (2nd ed.): the art of scientific computing , 1992 .
[19] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.
[20] Joshua Zhexue Huang,et al. A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining , 1997, DMKD.
[21] Daniel A. Keim,et al. An Efficient Approach to Clustering in Large Multimedia Databases with Noise , 1998, KDD.
[22] Sudipto Guha,et al. CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.
[23] A. Grossmann,et al. DECOMPOSITION OF FUNCTIONS INTO WAVELETS OF CONSTANT SHAPE, AND RELATED TRANSFORMS , 1985 .
[24] Hans-Peter Kriegel,et al. Incremental Clustering for Mining in a Data Warehousing Environment , 1998, VLDB.
[25] John A. Richards,et al. Remote Sensing Digital Image Analysis: An Introduction , 1999 .
[26] Tian Zhang,et al. BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.
[27] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[28] Aidong Zhang,et al. WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases , 1998, VLDB.
[29] C. V. Ramamoorthy,et al. Knowledge and Data Engineering , 1989, IEEE Trans. Knowl. Data Eng..
[30] Erich Schikuta,et al. The BANG-Clustering System: Grid-Based Data Analysis , 1997, IDA.
[31] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[32] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .