An Empirical Comparison of Stream Clustering Algorithms. Carnein, M., Assenmacher, D., & Trautmann, H. In Proceedings of the Computing Frontiers Conference, of CF'17, pages 361–366, New York, NY, USA, May, 2017. Association for Computing Machinery. ![An Empirical Comparison of Stream Clustering Algorithms [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Analysing streaming data has received considerable attention over the recent years. A key research area in this field is stream clustering which aims to recognize patterns in a possibly unbounded data stream of varying speed and structure. Over the past decades a multitude of new stream clustering algorithms have been proposed. However, to the best of our knowledge, no rigorous analysis and comparison of the different approaches has been performed. Our paper fills this gap and provides extensive experiments for a total of ten popular algorithms. We utilize a number of standard data sets of both, real and synthetic data and identify key weaknesses and strengths of the existing algorithms.
@inproceedings{carnein_empirical_2017,
address = {New York, NY, USA},
series = {{CF}'17},
title = {An {Empirical} {Comparison} of {Stream} {Clustering} {Algorithms}},
isbn = {978-1-4503-4487-6},
url = {https://doi.org/10.1145/3075564.3078887},
doi = {10.1145/3075564.3078887},
abstract = {Analysing streaming data has received considerable attention over the recent years. A key research area in this field is stream clustering which aims to recognize patterns in a possibly unbounded data stream of varying speed and structure. Over the past decades a multitude of new stream clustering algorithms have been proposed. However, to the best of our knowledge, no rigorous analysis and comparison of the different approaches has been performed. Our paper fills this gap and provides extensive experiments for a total of ten popular algorithms. We utilize a number of standard data sets of both, real and synthetic data and identify key weaknesses and strengths of the existing algorithms.},
urldate = {2022-03-25},
booktitle = {Proceedings of the {Computing} {Frontiers} {Conference}},
publisher = {Association for Computing Machinery},
author = {Carnein, Matthias and Assenmacher, Dennis and Trautmann, Heike},
month = may,
year = {2017},
keywords = {Data Streams, Online Clustering, Stream Clustering},
pages = {361--366},
}
Downloads: 0
{"_id":"wgLQuR9Q4XTg4wTmr","bibbaseid":"carnein-assenmacher-trautmann-anempiricalcomparisonofstreamclusteringalgorithms-2017","author_short":["Carnein, M.","Assenmacher, D.","Trautmann, H."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","address":"New York, NY, USA","series":"CF'17","title":"An Empirical Comparison of Stream Clustering Algorithms","isbn":"978-1-4503-4487-6","url":"https://doi.org/10.1145/3075564.3078887","doi":"10.1145/3075564.3078887","abstract":"Analysing streaming data has received considerable attention over the recent years. A key research area in this field is stream clustering which aims to recognize patterns in a possibly unbounded data stream of varying speed and structure. Over the past decades a multitude of new stream clustering algorithms have been proposed. However, to the best of our knowledge, no rigorous analysis and comparison of the different approaches has been performed. Our paper fills this gap and provides extensive experiments for a total of ten popular algorithms. We utilize a number of standard data sets of both, real and synthetic data and identify key weaknesses and strengths of the existing algorithms.","urldate":"2022-03-25","booktitle":"Proceedings of the Computing Frontiers Conference","publisher":"Association for Computing Machinery","author":[{"propositions":[],"lastnames":["Carnein"],"firstnames":["Matthias"],"suffixes":[]},{"propositions":[],"lastnames":["Assenmacher"],"firstnames":["Dennis"],"suffixes":[]},{"propositions":[],"lastnames":["Trautmann"],"firstnames":["Heike"],"suffixes":[]}],"month":"May","year":"2017","keywords":"Data Streams, Online Clustering, Stream Clustering","pages":"361–366","bibtex":"@inproceedings{carnein_empirical_2017,\n\taddress = {New York, NY, USA},\n\tseries = {{CF}'17},\n\ttitle = {An {Empirical} {Comparison} of {Stream} {Clustering} {Algorithms}},\n\tisbn = {978-1-4503-4487-6},\n\turl = {https://doi.org/10.1145/3075564.3078887},\n\tdoi = {10.1145/3075564.3078887},\n\tabstract = {Analysing streaming data has received considerable attention over the recent years. A key research area in this field is stream clustering which aims to recognize patterns in a possibly unbounded data stream of varying speed and structure. Over the past decades a multitude of new stream clustering algorithms have been proposed. However, to the best of our knowledge, no rigorous analysis and comparison of the different approaches has been performed. Our paper fills this gap and provides extensive experiments for a total of ten popular algorithms. We utilize a number of standard data sets of both, real and synthetic data and identify key weaknesses and strengths of the existing algorithms.},\n\turldate = {2022-03-25},\n\tbooktitle = {Proceedings of the {Computing} {Frontiers} {Conference}},\n\tpublisher = {Association for Computing Machinery},\n\tauthor = {Carnein, Matthias and Assenmacher, Dennis and Trautmann, Heike},\n\tmonth = may,\n\tyear = {2017},\n\tkeywords = {Data Streams, Online Clustering, Stream Clustering},\n\tpages = {361--366},\n}\n\n","author_short":["Carnein, M.","Assenmacher, D.","Trautmann, H."],"key":"carnein_empirical_2017","id":"carnein_empirical_2017","bibbaseid":"carnein-assenmacher-trautmann-anempiricalcomparisonofstreamclusteringalgorithms-2017","role":"author","urls":{"Paper":"https://doi.org/10.1145/3075564.3078887"},"keyword":["Data Streams","Online Clustering","Stream Clustering"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["data streams","online clustering","stream clustering"],"search_terms":["empirical","comparison","stream","clustering","algorithms","carnein","assenmacher","trautmann"],"title":"An Empirical Comparison of Stream Clustering Algorithms","year":2017}