A fast implementation of the em algorithm for mixture of multinomials

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4093 LNAI, Issue , 2006, Pages 517-524

  Patist, Jan Peter ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA REDUCTION; DATA STRUCTURES; INFORMATION ANALYSIS; DATA MINING; MIXTURES;

DATA SETS; EM ALGORITHMS; MULTINOMIALS; CLICKSTREAM DATA; CLICKSTREAMS; COMPRESSION RATES; COMPUTATIONAL EFFORT; FAST IMPLEMENTATION; MIXTURE OF MULTINOMIALS; MULTINOMIAL MIXTURE MODELS;

POLYNOMIALS; ALGORITHMS;

EID: 33749409949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11811305_57     Document Type: Conference Paper

References (17)

1. Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. In: SIGMOD '96: Proceedings of the 1996 ACM SIGMOD international conference on Management of data, New York, NY, USA, ACM Press (1996) 103-114
2. Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39 (1977) 1-38
3. Moore, A.: Very fast EM-based mixture model clustering using multiresolution kdtrees. In Kearns, M., Cohn, D., eds.: Advances in Neural Information Processing Systems, 340 Pine Street, 6th Fl., San Francisco, CA 94104, Morgan Kaufman (1999) 543-549
4. Bradley, P., Fayyad, U., Reina, C.: Scaling EM clustering to large databases, Microsoft research report, msr-tr-98-35 (1998)
5. Domingos, P., Hulten, G.: Learning from infinite data in finite time. Advances in Neural Information Processing Systems 14 (2002) 673-680
6. Verbeek, J., Nunnink, J., Vlassis, N.: Accelerated EM-based clustering of large datasets. Data Mining and Knowledge Discovery. In Press. (2006)
7. Neal, R., Hinton, G.: A view of the EM algorithm that justifies incremental, sparse, and other variants. In Jordan, M.I., ed.: Learning in Graphical Models, Kluwer (1998)
8. Cadez, I.V., Smyth, P., Mannila, H.: Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction. In: KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, New York, NY, USA, ACM Press (2001) 37-46
9. Thiesson, B., Meek, C., Heckerman, D.: Accelerating EM for large databases. Machine Learning 45 (2001) 279-299
10. Blekas, K., Likas, A.: Incremental mixture learning for clustering discrete data. Proc. 3rd Hellenic Conference on AI, SETN 2004 (2004) 210-219
11. Cadez, I.V., Heckerman, D., Meek, C., Smyth, P., White, S.: Visualization of navigation patterns on a web site using model-based clustering. In: Knowledge Discovery and Data Mining. (2000) 280-284
12. Vakali, A., Pokorn, J., Dalamagas, T.: An overview of web data clustering practices. Lecture Notes in Computer Science 3268 (2004) 597-606
13. Nasraoui, O., Zaiane, O.R., Spiliopoulou, M., Mobasher, B., Masand, B., YU, P.S.: Webkdd 2005: web mining and web usage analysis post-workshop report. SIGKDD Explor. Newsl. 7(2) (2005) 139-142
14. Hofgesang, P., Kowalczyk, W.: Analysis clickstream data: From anomaly detection to visitor profiling, ECML/PKDD Discovery Challenge 2005 (2005)
15. Hofgesang, P.: Web usage mining - Structuring enriched clickstream data, Msc. Thesis, Free University Amsterdam, The Netherlands (2005)
16. UCI-KDD-archive: (msnbc.com, University of California, Irvine, http://kdd.ics.uci.edu/)
17. Patist, J.P.: Toolbox for multinomial mixture building (www.few.vu.nl/~jpp/multimix.rar)