Gradual model generator for single-pass clustering

Pattern Recognition

Volumn 40, Issue 3, 2007, Pages 784-795

  Kärkkäinen, Ismo ^a   Fränti, Pasi ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Clustering; Gaussian mixture model; Large data sets; Single pass

Indexed keywords

APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; DATA STRUCTURES; MATHEMATICAL MODELS; OPTIMIZATION; USER INTERFACES;

CLUSTERING; GAUSSIAN MIXTURE MODEL; LARGE DATA SETS; SINGLE PASS;

ADAPTIVE ALGORITHMS;

EID: 33750517050     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.06.023     Document Type: Article

References (20)

1. Zhang T., Ramakrishnan R., and Livny M. BIRCH: a new data clustering algorithm and its applications. Data Mining and Knowledge Discovery 1 2 (1997) 141-182
2. Bradley P., Fayyad U., and Reina C. Scaling clustering algorithms to large databases. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (1998) 9-15
3. Guha S., Rastogi R., and Shim K. CURE: an efficient clustering algorithm for large databases. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 73-84
4. Ng R., and Han J. CLARANS: a method for clustering objects for spatial data mining. IEEE Trans. Knowledge Data Eng. 14 5 (2002) 1003-1016
5. Ester M., Kriegel H.-P., Sander J., and Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (1996) 226-231
6. Ankerst M., Breunig M., Kriegel H.-P., and Sander J. OPTICS: ordering points to identify the clustering structure. Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (1999) 49-60
7. Agrawal R., Gehrke J., Gunopulos D., and Raghavan P. Automatic subspace clustering of high dimensional data for data mining applications. Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data (1998) 94-105
8. Procopiuc C., Jones M., Agarwal P., and Murali T. A Monte Carlo algorithm for fast projective clustering. Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data (2002) 418-427
9. Sato M., and Ishii S. On-line EM algorithm for the normalized Gaussian network. Neural Comput. 12 2 (2000) 407-432
10. Bradley P., Fayyad U., and Reina C. Clustering very large databases using EM mixture models. Proceedings of the 15th International Conference on Pattern Recognition vol. 2 (2000) 76-80
11. Dempster A., Laird N., and Rubin D. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. B 39 (1977) 1-38
12. McLachlan G., and Krishnan T. The EM Algorithm and Extensions (1997), Wiley, New York
13. Ordonez C., and Omiecinski E. FREM: fast and robust EM clustering for large data sets. Proceedings of the 11th International Conference on Information and Knowledge Management (2002) 590-599
14. Bishop C.M. Neural Networks for Pattern Recognition (1996), Oxford University Press, Clarendon
15. MacQueen J. Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability (1967) 281-297
16. Bhattacharyya A. On a measure of divergence between two statistical populations defined by their distributions. Bull. Calcutta Math. Soc. 35 (1943) 99-110
17. Fukunaga K. Introduction to Statistical Pattern Recognition (1990), Academic Press, Boston
18. Jin H., Leung K.-S., Wong M.-L., and Xu Z.-B. Scalable model-based cluster analysis using clustering features. Pattern Recognition 38 5 (2005) 637-649
19. Ortega M., Rui Y., Chakrabati K., Porkaew K., Mehrotra S., and Huang T.S. Supporting ranked Boolean similarity queries in MARS. IEEE Trans. Knowledge Data Eng. 10 6 (1998) 905-925
20. S. Hettich, S. Bay, The UCI KDD Archive [http://kdd.ics.uci.edu], University of California, Department of Information and Computer Science, Irvine, CA, 1999.