Continuous subspace clustering in streaming time series

Information Systems

Volumn 33, Issue 2, 2008, Pages 240-260

  Kontaki, Maria ^a   Papadopoulos, Apostolos N ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Continuous processing; Sliding window; Streaming time series; Subspace clustering

Indexed keywords

COMPUTATIONAL METHODS; DATA MINING; LEARNING SYSTEMS; TIME SERIES ANALYSIS;

CONTINUOUS PROCESSING; SLIDING WINDOW; STREAMING TIME SERIES; SUBSPACE CLUSTERING;

CLUSTER ANALYSIS;

EID: 36749013108     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2007.09.001     Document Type: Article

References (25)

1. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'02), 2002, pp. 1-16.
2. Babu S., and Widom J. Continuous queries over data streams. ACM SIGMOD Rec. 30 3 (2001) 109-120
3. S. Chandrasekaran, M.J. Franklin, Streaming queries over streaming data, in: Proceedings of the International Conference on Very Large Databases (VLDB'02), 2002.
4. Han J., and Kamber M. Data Mining: Concepts and Techniques (2000), Morgan Kaufmann, Los Altos, CA
5. Dunham M.H. Data Mining: Introductory and Advanced Topics (2002), Prentice-Hall, Englewood Cliffs, NJ
6. J. Pei, X. Zhang, M. Cho, H. Wang, P.S. Yu, MaPle: a fast algorithm for maximal pattern-based clustering, in: Proceedings of the IEEE International Conference on Data Mining (ICDM'03), 2003, pp. 259-266.
7. H. Wang, W. Wang, J. Yang, P.S. Yu, Clustering by pattern similarity in large data sets, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD'02), 2002, pp. 394-405.
8. K. Beyer, J. Goldstein, R. Ramakrishnan, U. Shaft, When is nearest neighbors meaningful, in: Proceedings of the International Conference on Database Theory (ICDT'99), 1999, pp. 217-235.
9. J. Lin, E. Keogh, W. Truppel, Clustering of streaming time series is meaningless, in: Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'03), 2003.
10. R. Agrawal, J. Gehrke, D. Gunopoulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining application, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD'98), 1998, pp.94-105.
11. C. Cheng, A.W. Fu, Y. Zhang, Entropy-based subspace clustering for mining numerical data, in: Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD'99), 1999, pp. 84-93.
12. K. Kailing, H.P. Kriegel, P. Kroger, Density-connected subspace clustering for high-dimensional data, in: Proceedings of SIAM International Conference on Data Mining (SDM'04), 2004, pp. 246-257.
13. M. Ester, H.P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in: Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD'96), 1996, pp. 291-316.
14. H.V. Jagadish, J. Madar, R.T. Ng, Semantic compression and pattern extraction with fascicles, in: Proceedings of the International Conference on Very Large Databases (VLDB'99), 1999, pp. 186-198.
15. C.C. Aggarwal, C. Procopiuc, J.L. Wolf, P.S. Yu, J.S. Park, Fast algorithms for projected clustering, in: Proceedings of the ACM International Conference on Management of Data (SIGMOD'99), 1999, pp. 61-72.
16. C.C. Aggarwal, P.S. Yu, Finding generalized projected clusters in high dimensional spaces, in: Proceedings of the ACM International Conference on Management of Data, 2000, pp. 70-81.
17. J. Yang, W. Wang, H. Wang, P.S. Yu, δ-clusters: capturing subspace correlation in a large data set, in: Proceedings of the International Conference on Data Engineering (ICDE'02), 2002, pp. 517-528.
18. Y. Cheng, G.M. Church, Biclustering of expression data, in: Proceedings of the International Conference on Intelligent Systems for Molecular Biology (ISMB'00), 2000, pp. 93-103.
19. H. Wang, F. Chu, W. Fan, P.S. Yu, J. Pei, A fast algorithm for subspace clustering by pattern similarity, in: Proceedings of the Statistical and Scientific Database Management (SSDBM'04), 2004, pp. 51-60.
20. C.C. Aggarwal, J. Han, J. Wang, P.S. Yu, A framework for clustering evolving data streams, in: Proceedings of the International Conference on Very Large Databases (VLDB'03), 2003, pp. 81-92.
21. B. Babcock, M. Datar, R. Motwani, L. O'Callaghan, Maintaining variance and k-medians over data stream windows, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'03), 2003, pp. 234-243.
22. M. Charikar, L. O'Callaghan, R. Panigrahy, Better streaming algorithms for clustering problems, in: Proceedings of the Symposium on the Theory of Computing (STOC'03), 2003, pp. 30-39.
23. Guha S., Meyerson A., Mishra N., Motwani R., and O'Callaghan L. Clustering data streams: theory and practice. IEEE Trans. Knowl. Data Eng. 15 3 (2003) 515-528
24. C. Gupta, R. Grossman, GenIc: a single pass generalized incremental algorithm for clustering, in: Proceedings of SIAM International Conference on Data Mining (SDM'04), 2004.
25. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A.I. Verkamo, Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, (1996) 307-328.