Precise anytime clustering of noisy sensor data with logarithmic complexity

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 52-60

  Hassani, Marwan ^a   Kranen, Philipp ^a   Seidl, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Algorithms; Experimentation

Indexed keywords

DATA SETS; EXPERIMENTAL EVALUATION; EXPERIMENTATION; LINEAR TIME COMPLEXITY; LOGARITHMIC COMPLEXITY; LOGARITHMIC TIME; MODEL SIZE; NOISY SENSORS; RUNTIMES; SAMPLING RATES; SENSOR DATA; STORAGE RESOURCES; TREE ALGORITHMS;

DATA MINING; PLANT EXTRACTS; SENSORS; TREES (MATHEMATICS);

CLUSTERING ALGORITHMS;

EID: 80051706229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2003653.2003659     Document Type: Conference Paper

References (25)

1. Physiological Sensor Dataset in PDMC (ICML 2004 workshop) http://www.cs.utexas.edu/~sherstov/pdmc/.
2. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In VLDB, pages 81-92, 2003.
3. B. Arai, G. Das, D. Gunopulos, and N. Koudas. Anytime measures for top-k algorithms. In VLDB, pages 914-925, 2007.
4. N. L. Bowers, H. U. Gerber, J. C. Hickman, D. A. Jones, and C. J. Nesbitt. Actuarial Mathematics. Society of Actuaries, Itasca, IL, 1997.
5. F. Cao, M. Ester, W. Qian, and A. Zhou. Density-based clustering over an evolving data stream with noise. In SDM, 2006.
6. Y. Chen and L. Tu. Density-based clustering for real-time stream data. In KDD, pages 133-142, 2007. (Pubitemid 350229200)
7. D. DeCoste. Anytime interval-valued outputs for kernel machines: Fast support vector machine classiffication via distance geometry. In ICML, 2002.
8. M. Hassani, E. Müller, and T. Seidl. EDISKCO: energy efficient distributed in-sensor-network k-center clustering with outliers. In Proc. SensorKDD 2009, pages 39-48, 2009.
9. S. Hettich and S. Bay. The UCI KDD archive http://kdd.ics.uci.edu, 1999.
10. A. Jain, Z. Zhang, and E. Y. Chang. Adaptive non-linear clustering in data streams. In CIKM, pages 122-131, 2006. (Pubitemid 47203559)
11. P. Kranen, I. Assent, C. Baldauf, and T. Seidl. Self-adaptive anytime stream clustering. In IEEE ICDM, pages 249-258, 2009.
12. P. Kranen, I. Assent, C. Baldauf, and T. Seidl. The clustree: Indexing micro-clusters for anytime stream mining. In KAIS Journal, 2010.
13. P. Kranen, S. Günnemann, S. Fries, and T. Seidl. MC-tree: Improving bayesian anytime classiffication. In 22nd SSDBM, Springer LNCS, 2010.
14. P. Kranen, F. Reidl, F. S. Villaamil, and T. Seidl. Hierarchical clustering for real-time stream data with noise. In SSDBM (to appear), 2011.
15. P. Kranen and T. Seidl. Harnessing the strengths of anytime algorithms for constant data streams. DMKD Journal (19)2, ECML PKDD Special Issue, 2009.
16. G. Lin and L. Chen. A grid and fractal dimension-based data stream clustering algorithm. In ISISE, volume 1, pages 66 -70, 2008.
17. T. Seidl, I. Assent, P. Kranen, R. Krieger, and J. Herrmann. Indexing density models for incremental learning and anytime classiffication on data streams. In EDBT/ICDT, 2009.
18. J. Shieh and E. Keogh. Polishing the right apple: Anytime classiffication also benefits data streams with constant arrival times. In Proc. of ICDM, 2010.
19. Z. F. Siddiqui and M. Spiliopoulou. Combining multiple interrelated streams for incremental clustering. In SSDBM, pages 535-552, 2009.
20. W. N. Street and Y. Kim. A streaming ensemble algorithm (sea) for large-scale classiffication. In Proc. of the 7th ACM KDD, pages 377-382, 2001.
21. K. Ueno, X. Xi, E. J. Keogh, and D.-J. Lee. Anytime classiffication using the nearest neighbor algorithm with applications to stream mining. In ICDM, 2006.
22. H. Wang, W. Fan, P. S. Yu, and J. Han. Mining concept-drifting data streams using ensemble classifiers. In Proc. of the 9th ACM KDD, pages 226-235, 2003.
23. Y. Yang, G. I. Webb, K. B. Korb, and K. M. Ting. Classifying under computational resource constraints: anytime classiffication using probabilistic estimators. Machine Learning, 69(1), 2007.
24. L. Ye, X. Wang, E. J. Keogh, and A. Mafra-Neto. Autocannibalistic and anyspace indexing algorithms with application to sensor data mining. In SDM, pages 85-96, 2009.
25. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: an efficient data clustering method for very large databases. In SIGMOD, 1996.