Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 576-584

  Salvador, Stan ^a   Chan, Philip ^a  

^a Florida Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; L METHOD; LEARNING PROCESSES; SEGMENTATION ALGORITHMS;

ALGORITHMS; DATABASE SYSTEMS; ERROR ANALYSIS; GRAPH THEORY; LEARNING SYSTEMS; STATISTICAL METHODS;

HIERARCHICAL SYSTEMS;

EID: 16244377091     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.50     Document Type: Conference Paper

References (24)

1. Baxter, R. & J. Oliver. The Kindest Cut: Minimum Message Length Segmentation. In Proc. ALT, pp. 83-90, 1996.
2. Chiu, T., D. Fang, J. Chen, Y. Wang & C. Jeris. A Robust and Scalable Clustering Algorithm for Mixed Type Attributes in Large Database Environment. In Proc. SIGKDD, pp. 263-268, 2001.
3. Ester, M., H. Kriegel, J. Sander, and X. Xu. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. KDD, pp. 226-231, 1996.
4. Foss, A. & A. Zaïane. A Parameterless Method for Efficiently Discovering Clusters of Arbitrary Shape in Large Datasets. In Proc. ICDM, 2002.
5. Fraley, C. & E. Raftery. How many clusters? Which clustering method? Answers via model-based Cluster Analysis. In Computer Journal, vol. 41, pp. 578-588, 1998.
6. Guha, S., R. Rastogi & K. Shim. CURE: An Efficient Clustering Algorithm for Large Databases. In Proc. Of ACM SIGMOD Intl. Conf. on Management of Data, pp. 73-82, 1998.
7. Harris, S., D. Hess & J. Venegas. An Objective Analysis of the Pressure-Volume Curve in the Acute Respiratory Distress Syndrome. In American Journal of Respiratory and Critical Care Medicine, vol. 161, no. 2, pp. 432-439, 2000.
8. Hansen, M. & B. Yu. Model Selection and the Principle of Minimum Description Length. In JASA, vol. 96, pp.746-774, 2001.
9. Hinneburg A. & D. Keim. An Efficient Approach to Clustering in Large Multimedia Databases with Noise. In Proc. KDD, pp. 58-65, 1998.
10. Karypis, O., E. Han & V. Kumar. Chameleon: A Hierarchical Clustering Algorithm Using Dynamic Modeling. In IEEE Computer, 32(8) pp. 68-75, 1999.
11. Keogh, E., S. Chu, D. Hart & M. Pazanni. An Online Algorithm for Segmenting Time Series. In Proc. ICDM, pp. 289-296, 2001.
12. Keogh, E. & T. Folias. The UCR Time Series Data Mining Archive [http://www.cs.ucr.edu/~eamonn/TSDMA/index.html]. Riverside, CA, Univ. of California.
13. Monti, S., T. Pablo, J. Mesirov & T. Golub. Consensus Clustering: A Resampling-Based Method for Class Discovery and Visualization of Gene Expression Microarray Data. In Machine Learning, vol. 52, pp. 91-118, 2003.
14. Ng R., J. Han. Efficient and Effective Clustering Method for Spatial Data Mining. In Proc. VLDB, pp. 144-155, 1994.
15. Roth, V., T. Lange, M. Braun & J. Buhmann. A Resampling Approach to Cluster Validation. In Proc. COMPSTAT, pp. 123-129, 2002.
16. Salvador, S., P. Chan & J. Brodie. Learning States and Rules for Time Series Anomaly Detection. In Proc. FLAIRS, pp. 300-305, 2004.
17. Seikholeslami G., S. Chatterjee, & A Zhang. WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases. Proc. VLDB, pp. 428-439, 1998.
18. Smyth, P. Clustering Using Monte-Carlo Cross-Validation. In Proc. KDD, pp.126-133, 1996.
19. Sugiyama, M. & H. Ogawa. Subspace Information Criterion for Model Selection. In Neural Computation, vol. 13, no. 8, pp. 1863-1889, 2001.
20. Tibshirani, R., G. Walther, D. Botstein & P. Brown. Cluster Validation by Prediction Strength, Tech. Report, 2001-21, Dept. of Biostatistics, Stanford Univ, 2001.
21. Tibshirani, R., G. Walther & T. Hastie. Estimating the number of clusters in a dataset via the Gap statistic. In JRSSB, 2003.
22. Vasko, K. & T. Toivonen. Estimating the Number of Segments in Time Series Data Using Permutation Tests. In Proc. ICDM, pp. 466-473, 2002.
23. Weisstein, E. "Least Squares Fitting". From MathWorld-A Wolfram Web Resource. [http://mathworld.wolfram.com/LeastSquaresFitting.html].
24. Zhang, T., R. Ramakrishnan & M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases, In ACM SIGMOD Intl. Conf. on Management of Data, pp. 103-114, 1996.