rEMM: Extensible Markov model for data stream clustering in R

Journal of Statistical Software

Volumn 35, Issue 5, 2010, Pages 1-31

  Hahsler, Michael ^a   Dunham, Margaret H ^a  

^a Southern Methodist University   (United States)

Author keywords

Clustering; Data mining; Data streams; Markov chain

Indexed keywords

EID: 77955150621     PISSN: 15487660     EISSN: 15487660     Source Type: Journal    
DOI: 10.18637/jss.v035.i05     Document Type: Article

References (40)

1. Aggarwal C (2009). A Framework for Clustering Massive-Domain Data Streams. In IEEE 25th International Conference on Data Engineering (ICDE '09), pp. 102-113.
2. Aggarwal CC, Han J, Wang J, Yu PS (2003). A Framework for Clustering Evolving Data Streams. In Proceedings of the International Conference on Very Large Data Bases (VLDB '03), pp. 81-92.
3. Aggarwal CC, Han J, Wang J, Yu PS (2004).A Framework for Projected Clustering of High Dimensional Data Streams. In Proceedings of the Thirtieth International Conference on Very Large Data Bases (VLDB '04), pp. 852-863. ISBN 0-12-088469-0.
4. Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990). Basic Local Alignment Search Tool. Journal of Molecular Biology, 215(3), 403-410.
5. Ankerst M, Breunig MM, Kriegel HP, Sander J (1999). OPTICS: Ordering Points To Identify the Clustering Structure. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, pp. 49-60.
6. Cao F, Ester M, Qian W, Zhou A (2006). Density-Based Clustering over an Evolving Data Stream with Noise. In Proceedings of the 2006 SIAM International Conference on Data Mining, pp. 328-339. SIAM.
7. Cormack GV, Horspool RNS (1987). Data Compression Using Dynamic Markov Modeling.The Computer Journal, 30(6).
8. Cox T, Cox M (2001). Multidimensional Scaling. Chapman and Hall.
9. Deschavanne PJ, Giron A, Vilain J, Fagot G, Fertil B (1999). Genomic Signature: Characterization and Classiffication of Species Assessed by Chaos Game Representation of Sequences.Molecular Biology and Evolution, 16(10), 1391-1399.
10. Dunham MH, Meng Y, Huang J (2004). Extensible Markov Model. In Proceedings IEEE ICDM Conference, pp. 371-374. IEEE.
11. Fowler M (2004). UML Distilled: A Brief Guide to the Standard Object Modeling Language. 3rd edition. Addison-Wesley Professional.
12. Gentry J, Long L, Gentleman R, Falcon S, Hahne F, Sarkar D (2010). Rgraphviz: Provides Plotting Capabilities for R Graph Objects. R package version 1.26.0, URL http://www.bioconductor.org/packages/2.6/bioc/html/Rgraphviz.html.
13. Goldberg D, Mataric MJ (1999). Coordinating Mobile Robot Group Behavior Using a Model of Interaction Dynamics. In Proceedings of the Third International Conference on Autonomous Agents.
14. Guha S, Meyerson A, Mishra N, Motwani R, O'Callaghan L (2003). Clustering data Streams: Theory and Practice. IEEE Transactions on Knowledge and Data Engineering, 15(3), 515-528.
15. Guha S, Mishra N, Motwani R, O'Callaghan L (2000). Clustering Data Streams. In Proceedings of the ACM Symposium on Foundations of Computer Science, pp. 359-366.
16. Hughey R, Krogh A (1996). Hidden Markov Models for Sequence Analysis: Extension and Analysis of the Basic Method. Computational Applications in Bioscience, 12(2), 95-107.
17. Isaksson C, Meng Y, Dunham MH (2006). Risk Leveling of Network Traffic Anomalies.International Journal of Computer Science and Network Security, 6(6), 258-265.
18. Kijima M (1997). Markov Processes for Stochastic Modeling. Stochastic Modeling Series. Chapman & Hall/CRC, Boca Raton.
19. Kriegel HP, Kröger P, Gotlibovich I (2003). Incremental OPTICS: Efficient Computation of Updates in a Hierarchical Cluster Ordering. In Data Warehousing and Knowledge Discovery, volume 2737 of Lecture Notes in Computer Science, pp. 224-233. Springer-Verlag.
20. Leisch F (2006). A Toolbox for K-Centroids Cluster Analysis. Computational Statistics & Data Analysis, 51(2), 526-544.
21. Lu L, Dunham MH, Meng Y (2006). Mining Signifficant Usage Patterns from Clickstream Data. In Advances in Web Mining and Web Usage Analysis, volume 4198 of Lecture Notes in Computer Science. Springer-Verlag.
22. Maechler M, Rousseeuw P, Struyf A, Hubert M (2010). cluster: Cluster Analysis Basics and Extensions. R package version 1.13.1, URL http://CRAN.R-project.org/package=cluster.
23. Meng Y, Dunham MH (2006). Efficient Mining of Emerging Events in a Dynamic Spatiotemporal Environment. In Advances in Knowledge Discovery and Data Mining, volume 3918 of Lecture Notes in Computer Science, pp. 750-754. Springer-Verlag.
24. Meng Y, Dunham MH (2006b). Mining Developing Trends of Dynamic Spatiotemporal Data Streams. Journal of Computers, 1(3), 43-50.
25. Meng Y, Dunham MH (2006c). Online Mining of Risk Level of Traffic Anomalies with User's Feedbacks. In Proceedings of the IEEE International Conference on Granular Computing, pp. 176-181.
26. Meng Y, Dunham MH, Marchetti F, Huang J (2006). Rare Event Detection in a Spatiotemporal Environment. In Proceedings of the IEEE International Conference on Granular Computing, pp. 629-634.
27. Meyer D, Buchta C (2010). proxy: Distance and Similarity Measures. R package version 0.4-6, URL http://CRAN.R-project.org/package=proxy.
28. O'Callaghan L, Mishra N, Meyerson A, Guha S, Motwani R (2002). Streaming-data Algorithms for High-quality Clustering. In Proceedings of the 18th International Conference on Data Engineering (ICDE'02), pp. 685-. IEEE Computer Society.
29. Ostendorf M, Singer H (1997).HMM Topology Desing Using Maximum Likelihood Successive State Splitting. Computer Speech and Language, 11(1), 17-41.
30. Parzen E (1999). Stochastic Processes. Society for Industrial Mathematics.
31. R Development Core Team (2010). R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria. ISBN 3-900051-07-0, URL http://www.R-project.org/.
32. Sander J, Ester M, Kriegel HP, Xu X (1998). Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications.Data Minining and Knowledge Discovery, 2(2), 169-194.
33. Tasoulis D, Adams N, Hand D (2006). Unsupervised Clustering in Streaming Data. In IEEE International Workshop on Mining Evolving and Streaming Data. Sixth IEEE International Conference on Data Mining (ICDM 2006), pp. 638-642.
34. Tasoulis DK, Ross G, Adams NM (2007). Visualising the Cluster Structure of Data Streams.In Advances in Intelligent Data Analysis VII, Lecture Notes in Computer Science, pp. 81-92. Springer-Verlag.
35. Tu L, Chen Y (2009). Stream Data Clustering Based on Grid Density and Attraction. ACM Transactions on Knowledge Discovery from Data, 3(3), 1-27. ISSN 1556-4681.
36. Vinga S, Almeida J (2003). Alignment-Free Sequence Comparison-A Review. Bioinformatics, 19(4), 513-523.
37. Wan L, Ng WK, Dang XH, Yu PS, Zhang K (2009). Density-Based Clustering of Data Streams at Multiple Resolutions. ACM Transactions on Knowledge Discovery from Data, 3(3), 1-28. ISSN 1556-4681.
38. Wang Q, Garrity GM, Tiedje JM, Cole JR (2007). Naive Bayesian Classiffier for Rapid Assignment of rRNA Sequences into the new Bacterial Taxonomy. Applied and Environmental Microbiology, 73(16), 5261-5267.
39. Wu TJ, Hsieh YC, Li LA (2001). Statistical Measures of DNA Sequence Dissimilarity under Markov Chain Models of Base Composition. Biometrics, 57(2), 441-448.
40. Zhang T, Ramakrishnan R, Livny M (1996). BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103-114. ACM.