Density-based Projected Clustering over High Dimensional Data Streams

Density-based Projected Clustering over High Dimensional Data Streams. Ntoutsi, I., Zimek, A., Palpanas, T., Kröger, P., & Kriegel, H. In Proceedings of the 2012 SIAM International Conference on Data Mining (SDM), of Proceedings, pages 987–998. Society for Industrial and Applied Mathematics, April, 2012.

Paper doi abstract bibtex

Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately proposed for solving independently the different aspects of the problem. There exist methods for clustering over full dimensional streams and methods for finding clusters in subspaces of high dimensional static data. Yet only a few approaches have been proposed so far which tackle both the stream and the high dimensionality aspects of the problem simultaneously. In this work, we propose a new density-based projected clustering algorithm, HDDSTREAM, for high dimensional data streams. Our algorithm summarizes both the data points and the dimensions where these points are grouped together and maintains these summaries online, as new points arrive over time and old points expire due to ageing. Our experimental results illustrate the effectiveness and the efficiency of HDDSTREAM and also demonstrate that it could serve as a trigger for detecting drastic changes in the underlying stream population, like bursts of network attacks.

@incollection{ntoutsi_density-based_2012,
	series = {Proceedings},
	title = {Density-based {Projected} {Clustering} over {High} {Dimensional} {Data} {Streams}},
	isbn = {978-1-61197-232-0},
	url = {https://epubs.siam.org/doi/abs/10.1137/1.9781611972825.85},
	abstract = {Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately proposed for solving independently the different aspects of the problem. There exist methods for clustering over full dimensional streams and methods for finding clusters in subspaces of high dimensional static data. Yet only a few approaches have been proposed so far which tackle both the stream and the high dimensionality aspects of the problem simultaneously. In this work, we propose a new density-based projected clustering algorithm, HDDSTREAM, for high dimensional data streams. Our algorithm summarizes both the data points and the dimensions where these points are grouped together and maintains these summaries online, as new points arrive over time and old points expire due to ageing. Our experimental results illustrate the effectiveness and the efficiency of HDDSTREAM and also demonstrate that it could serve as a trigger for detecting drastic changes in the underlying stream population, like bursts of network attacks.},
	urldate = {2023-02-16},
	booktitle = {Proceedings of the 2012 {SIAM} {International} {Conference} on {Data} {Mining} ({SDM})},
	publisher = {Society for Industrial and Applied Mathematics},
	author = {Ntoutsi, Irene and Zimek, Arthur and Palpanas, Themis and Kröger, Peer and Kriegel, Hans-Peter},
	month = apr,
	year = {2012},
	doi = {10.1137/1.9781611972825.85},
	pages = {987--998},
}

Downloads: 0

{"_id":"hs5zJE6hj6JzpsBi2","bibbaseid":"ntoutsi-zimek-palpanas-krger-kriegel-densitybasedprojectedclusteringoverhighdimensionaldatastreams-2012","author_short":["Ntoutsi, I.","Zimek, A.","Palpanas, T.","Kröger, P.","Kriegel, H."],"bibdata":{"bibtype":"incollection","type":"incollection","series":"Proceedings","title":"Density-based Projected Clustering over High Dimensional Data Streams","isbn":"978-1-61197-232-0","url":"https://epubs.siam.org/doi/abs/10.1137/1.9781611972825.85","abstract":"Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately proposed for solving independently the different aspects of the problem. There exist methods for clustering over full dimensional streams and methods for finding clusters in subspaces of high dimensional static data. Yet only a few approaches have been proposed so far which tackle both the stream and the high dimensionality aspects of the problem simultaneously. In this work, we propose a new density-based projected clustering algorithm, HDDSTREAM, for high dimensional data streams. Our algorithm summarizes both the data points and the dimensions where these points are grouped together and maintains these summaries online, as new points arrive over time and old points expire due to ageing. Our experimental results illustrate the effectiveness and the efficiency of HDDSTREAM and also demonstrate that it could serve as a trigger for detecting drastic changes in the underlying stream population, like bursts of network attacks.","urldate":"2023-02-16","booktitle":"Proceedings of the 2012 SIAM International Conference on Data Mining (SDM)","publisher":"Society for Industrial and Applied Mathematics","author":[{"propositions":[],"lastnames":["Ntoutsi"],"firstnames":["Irene"],"suffixes":[]},{"propositions":[],"lastnames":["Zimek"],"firstnames":["Arthur"],"suffixes":[]},{"propositions":[],"lastnames":["Palpanas"],"firstnames":["Themis"],"suffixes":[]},{"propositions":[],"lastnames":["Kröger"],"firstnames":["Peer"],"suffixes":[]},{"propositions":[],"lastnames":["Kriegel"],"firstnames":["Hans-Peter"],"suffixes":[]}],"month":"April","year":"2012","doi":"10.1137/1.9781611972825.85","pages":"987–998","bibtex":"@incollection{ntoutsi_density-based_2012,\n\tseries = {Proceedings},\n\ttitle = {Density-based {Projected} {Clustering} over {High} {Dimensional} {Data} {Streams}},\n\tisbn = {978-1-61197-232-0},\n\turl = {https://epubs.siam.org/doi/abs/10.1137/1.9781611972825.85},\n\tabstract = {Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately proposed for solving independently the different aspects of the problem. There exist methods for clustering over full dimensional streams and methods for finding clusters in subspaces of high dimensional static data. Yet only a few approaches have been proposed so far which tackle both the stream and the high dimensionality aspects of the problem simultaneously. In this work, we propose a new density-based projected clustering algorithm, HDDSTREAM, for high dimensional data streams. Our algorithm summarizes both the data points and the dimensions where these points are grouped together and maintains these summaries online, as new points arrive over time and old points expire due to ageing. Our experimental results illustrate the effectiveness and the efficiency of HDDSTREAM and also demonstrate that it could serve as a trigger for detecting drastic changes in the underlying stream population, like bursts of network attacks.},\n\turldate = {2023-02-16},\n\tbooktitle = {Proceedings of the 2012 {SIAM} {International} {Conference} on {Data} {Mining} ({SDM})},\n\tpublisher = {Society for Industrial and Applied Mathematics},\n\tauthor = {Ntoutsi, Irene and Zimek, Arthur and Palpanas, Themis and Kröger, Peer and Kriegel, Hans-Peter},\n\tmonth = apr,\n\tyear = {2012},\n\tdoi = {10.1137/1.9781611972825.85},\n\tpages = {987--998},\n}\n\n","author_short":["Ntoutsi, I.","Zimek, A.","Palpanas, T.","Kröger, P.","Kriegel, H."],"key":"ntoutsi_density-based_2012","id":"ntoutsi_density-based_2012","bibbaseid":"ntoutsi-zimek-palpanas-krger-kriegel-densitybasedprojectedclusteringoverhighdimensionaldatastreams-2012","role":"author","urls":{"Paper":"https://epubs.siam.org/doi/abs/10.1137/1.9781611972825.85"},"metadata":{"authorlinks":{}}},"bibtype":"incollection","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":[],"search_terms":["density","based","projected","clustering","over","high","dimensional","data","streams","ntoutsi","zimek","palpanas","kröger","kriegel"],"title":"Density-based Projected Clustering over High Dimensional Data Streams","year":2012}