SOStream: Self Organizing Density-Based Clustering over Data Stream. Isaksson, C., Dunham, M. H., & Hahsler, M. In Machine Learning and Data Mining in Pattern Recognition, of Lecture Notes in Computer Science, pages 264–278, Berlin, Heidelberg, 2012. Springer. doi abstract bibtex In this paper we propose a data stream clustering algorithm, called Self Organizing density based clustering over data Stream (SOStream). This algorithm has several novel features. Instead of using a fixed, user defined similarity threshold or a static grid, SOStream detects structure within fast evolving data streams by automatically adapting the threshold for density-based clustering. It also employs a novel cluster updating strategy which is inspired by competitive learning techniques developed for Self Organizing Maps (SOMs). In addition, SOStream has built-in online functionality to support advanced stream clustering operations including merging and fading. This makes SOStream completely online with no separate offline components. Experiments performed on KDD Cup’99 and artificial datasets indicate that SOStream is an effective and superior algorithm in creating clusters of higher purity while having lower space and time requirements compared to previous stream clustering algorithms.
@inproceedings{isaksson_sostream_2012,
address = {Berlin, Heidelberg},
series = {Lecture {Notes} in {Computer} {Science}},
title = {{SOStream}: {Self} {Organizing} {Density}-{Based} {Clustering} over {Data} {Stream}},
isbn = {978-3-642-31537-4},
shorttitle = {{SOStream}},
doi = {10.1007/978-3-642-31537-4_21},
abstract = {In this paper we propose a data stream clustering algorithm, called Self Organizing density based clustering over data Stream (SOStream). This algorithm has several novel features. Instead of using a fixed, user defined similarity threshold or a static grid, SOStream detects structure within fast evolving data streams by automatically adapting the threshold for density-based clustering. It also employs a novel cluster updating strategy which is inspired by competitive learning techniques developed for Self Organizing Maps (SOMs). In addition, SOStream has built-in online functionality to support advanced stream clustering operations including merging and fading. This makes SOStream completely online with no separate offline components. Experiments performed on KDD Cup’99 and artificial datasets indicate that SOStream is an effective and superior algorithm in creating clusters of higher purity while having lower space and time requirements compared to previous stream clustering algorithms.},
language = {en},
booktitle = {Machine {Learning} and {Data} {Mining} in {Pattern} {Recognition}},
publisher = {Springer},
author = {Isaksson, Charlie and Dunham, Margaret H. and Hahsler, Michael},
editor = {Perner, Petra},
year = {2012},
keywords = {Adaptive Threshold, Data Stream Clustering, Density-Based Clustering, Self Organizing Maps},
pages = {264--278},
}
Downloads: 0
{"_id":"LEHyRmLGqDasFBqaF","bibbaseid":"isaksson-dunham-hahsler-sostreamselforganizingdensitybasedclusteringoverdatastream-2012","author_short":["Isaksson, C.","Dunham, M. H.","Hahsler, M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"Berlin, Heidelberg","series":"Lecture Notes in Computer Science","title":"SOStream: Self Organizing Density-Based Clustering over Data Stream","isbn":"978-3-642-31537-4","shorttitle":"SOStream","doi":"10.1007/978-3-642-31537-4_21","abstract":"In this paper we propose a data stream clustering algorithm, called Self Organizing density based clustering over data Stream (SOStream). This algorithm has several novel features. Instead of using a fixed, user defined similarity threshold or a static grid, SOStream detects structure within fast evolving data streams by automatically adapting the threshold for density-based clustering. It also employs a novel cluster updating strategy which is inspired by competitive learning techniques developed for Self Organizing Maps (SOMs). In addition, SOStream has built-in online functionality to support advanced stream clustering operations including merging and fading. This makes SOStream completely online with no separate offline components. Experiments performed on KDD Cup’99 and artificial datasets indicate that SOStream is an effective and superior algorithm in creating clusters of higher purity while having lower space and time requirements compared to previous stream clustering algorithms.","language":"en","booktitle":"Machine Learning and Data Mining in Pattern Recognition","publisher":"Springer","author":[{"propositions":[],"lastnames":["Isaksson"],"firstnames":["Charlie"],"suffixes":[]},{"propositions":[],"lastnames":["Dunham"],"firstnames":["Margaret","H."],"suffixes":[]},{"propositions":[],"lastnames":["Hahsler"],"firstnames":["Michael"],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Perner"],"firstnames":["Petra"],"suffixes":[]}],"year":"2012","keywords":"Adaptive Threshold, Data Stream Clustering, Density-Based Clustering, Self Organizing Maps","pages":"264–278","bibtex":"@inproceedings{isaksson_sostream_2012,\n\taddress = {Berlin, Heidelberg},\n\tseries = {Lecture {Notes} in {Computer} {Science}},\n\ttitle = {{SOStream}: {Self} {Organizing} {Density}-{Based} {Clustering} over {Data} {Stream}},\n\tisbn = {978-3-642-31537-4},\n\tshorttitle = {{SOStream}},\n\tdoi = {10.1007/978-3-642-31537-4_21},\n\tabstract = {In this paper we propose a data stream clustering algorithm, called Self Organizing density based clustering over data Stream (SOStream). This algorithm has several novel features. Instead of using a fixed, user defined similarity threshold or a static grid, SOStream detects structure within fast evolving data streams by automatically adapting the threshold for density-based clustering. It also employs a novel cluster updating strategy which is inspired by competitive learning techniques developed for Self Organizing Maps (SOMs). In addition, SOStream has built-in online functionality to support advanced stream clustering operations including merging and fading. This makes SOStream completely online with no separate offline components. Experiments performed on KDD Cup’99 and artificial datasets indicate that SOStream is an effective and superior algorithm in creating clusters of higher purity while having lower space and time requirements compared to previous stream clustering algorithms.},\n\tlanguage = {en},\n\tbooktitle = {Machine {Learning} and {Data} {Mining} in {Pattern} {Recognition}},\n\tpublisher = {Springer},\n\tauthor = {Isaksson, Charlie and Dunham, Margaret H. and Hahsler, Michael},\n\teditor = {Perner, Petra},\n\tyear = {2012},\n\tkeywords = {Adaptive Threshold, Data Stream Clustering, Density-Based Clustering, Self Organizing Maps},\n\tpages = {264--278},\n}\n\n\n\n\n\n\n\n","author_short":["Isaksson, C.","Dunham, M. H.","Hahsler, M."],"editor_short":["Perner, P."],"key":"isaksson_sostream_2012","id":"isaksson_sostream_2012","bibbaseid":"isaksson-dunham-hahsler-sostreamselforganizingdensitybasedclusteringoverdatastream-2012","role":"author","urls":{},"keyword":["Adaptive Threshold","Data Stream Clustering","Density-Based Clustering","Self Organizing Maps"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["adaptive threshold","data stream clustering","density-based clustering","self organizing maps"],"search_terms":["sostream","self","organizing","density","based","clustering","over","data","stream","isaksson","dunham","hahsler"],"title":"SOStream: Self Organizing Density-Based Clustering over Data Stream","year":2012}