<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>An Empirical Comparison of Stream Clustering Algorithms</title></titleInfo>





<name type="personal">
  <namePart type="given">Matthias</namePart>
  <namePart type="family">Carnein</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Dennis</namePart>
  <namePart type="family">Assenmacher</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Heike</namePart>
  <namePart type="family">Trautmann</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">100740</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-9788-8282</description></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">34</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>

<name type="corporate">
  <namePart></namePart>
  <identifier type="local">819</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">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.</abstract>

<originInfo><dateIssued encoding="w3cdtf">2017</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)</title></titleInfo>
  <identifier type="isbn">978-1-4503-4487-6/17/05</identifier><identifier type="doi">10.1145/3075564.3078887</identifier>
<part><extent unit="pages">361–365</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<chicago>Carnein, Matthias, Dennis Assenmacher, and Heike Trautmann. “An Empirical Comparison of Stream Clustering Algorithms.” In &lt;i&gt;Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)&lt;/i&gt;, 361–365. Siena, Italy, 2017. &lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;https://doi.org/10.1145/3075564.3078887&lt;/a&gt;.</chicago>
<ieee>M. Carnein, D. Assenmacher, and H. Trautmann, “An Empirical Comparison of Stream Clustering Algorithms,” in &lt;i&gt;Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)&lt;/i&gt;, 2017, pp. 361–365, doi: &lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;10.1145/3075564.3078887&lt;/a&gt;.</ieee>
<ama>Carnein M, Assenmacher D, Trautmann H. An Empirical Comparison of Stream Clustering Algorithms. In: &lt;i&gt;Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)&lt;/i&gt;. ; 2017:361–365. doi:&lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;10.1145/3075564.3078887&lt;/a&gt;</ama>
<apa>Carnein, M., Assenmacher, D., &amp;#38; Trautmann, H. (2017). An Empirical Comparison of Stream Clustering Algorithms. &lt;i&gt;Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)&lt;/i&gt;, 361–365. &lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;https://doi.org/10.1145/3075564.3078887&lt;/a&gt;</apa>
<mla>Carnein, Matthias, et al. “An Empirical Comparison of Stream Clustering Algorithms.” &lt;i&gt;Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)&lt;/i&gt;, 2017, pp. 361–365, doi:&lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;10.1145/3075564.3078887&lt;/a&gt;.</mla>
<bibtex>@inproceedings{Carnein_Assenmacher_Trautmann_2017, place={Siena, Italy}, title={An Empirical Comparison of Stream Clustering Algorithms}, DOI={&lt;a href=&quot;https://doi.org/10.1145/3075564.3078887&quot;&gt;10.1145/3075564.3078887&lt;/a&gt;}, booktitle={Proceedings of the ACM International Conference on Computing Frontiers (CF ’17)}, author={Carnein, Matthias and Assenmacher, Dennis and Trautmann, Heike}, year={2017}, pages={361–365} }</bibtex>
<short>M. Carnein, D. Assenmacher, H. Trautmann, in: Proceedings of the ACM International Conference on Computing Frontiers (CF ’17), Siena, Italy, 2017, pp. 361–365.</short>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>46358</recordIdentifier><recordCreationDate encoding="w3cdtf">2023-08-04T15:04:09Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2023-10-16T13:35:59Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
