Density-based projected clustering over high dimensional data streams

Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012

Volumn , Issue , 2012, Pages 987-998

  Ntoutsi, Irene ^a   Zimek, Arthur ^a   Palpanas, Themis ^b   Kröger, Peer ^a   Kriegel, Hans Peter ^a  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; SPACE DIVISION MULTIPLE ACCESS;

DENSITY-BASED; HIGH DIMENSIONALITY; HIGH-DIMENSIONAL; HIGH-DIMENSIONAL DATA STREAMS; NETWORK ATTACK; NETWORK MONITORING; PROJECTED CLUSTERING; STATIC DATUM;

CLUSTERING ALGORITHMS;

EID: 84868121916     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972825.85     Document Type: Conference Paper

References (22)

1. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for clustering evolving data streams. In Proc. VLDB, 2003.
2. C. C. Aggarwal, J. Han, J. Wang, and P. S. Yu. A framework for projected clustering of high dimensional data streams. In Proc. VLDB, 2004.
3. C. C. Aggarwal, C. M. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In Proc. SIGMOD, 1999.
4. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proc. SIGMOD, 1998.
5. A. Bifet, G. Holmes, R. Kirkby, and B. Pfahringer. MOA: Massive online analysis. J. Mach. Learn. Res., 11:1601-1604, 2010.
6. C. Böhm, K. Kailing, H.-P. Kriegel, and P. Kröger. Density connected clustering with local subspace preferences. In Proc. ICDM, 2004.
7. F. Cao, M. Ester, W. Qian, and A. Zhou. Densitybased clustering over an evolving data stream with noise. In Proc. SDM, 2006.
8. Y. Chen and L. Tu. Density-based clustering for realtime stream data. In Proc. KDD, 2007.
9. M. Ester, H.-P. Kriegel, J. Sander, M. Wimmer, and X. Xu. Incremental clustering for mining in a data warehousing environment. In Proc. VLDB, 1998.
10. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. KDD, 1996.
11. J. Gao, J. Li, Z. Zhang, and P.-N. Tan. An incremental data stream clustering algorithm based on dense units detection. In Proc. PAKDD, 2005.
12. M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and mining data streams: you only get one look. A tutorial. In Proc. SIGMOD, 2002.
13. S. Guha, A. Meyerson, N. Mishra, R. Motwani, and L. O'Callaghan. Clustering data streams: Theory and practice. IEEE TKDE, 15(3):515-528, 2003.
14. P. Kranen, I. Assent, C. Baldauf, and T. Seidl. Selfadaptive anytime stream clustering. In Proc. ICDM, 2009.
15. H.-P. Kriegel, P. Kröger, I. Ntoutsi, and A. Zimek. Density based subspace clustering over dynamic data. In Proc. SSDBM, 2011.
16. H.-P. Kriegel, P. Kröger, and A. Zimek. Clustering high dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM TKDD, 3(1):1-58, 2009.
17. H.-P. Kriegel, P. Kröger, J. Sander, and A. Zimek. Density-based clustering. WIREs DMKD, 1(3):231- 240, 2011.
18. P. Kröger, H.-P. Kriegel, and K. Kailing. Densityconnected subspace clustering for high-dimensional data. In Proc. SDM, 2004.
19. G. Moise, J. Sander, and M. Ester. Robust projected clustering. KAIS, 14(3):273-298, 2008.
20. M. L. Yiu and N. Mamoulis. Iterative projected clustering by subspace mining. IEEE TKDE, 17(2):176- 189, 2005.
21. Q. Zhang, J. Liu, and W. Wang. Incremental subspace clustering over multiple data streams. In Proc. ICDM, 2007.
22. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In Proc. SIGMOD, 1996.