A Fast and Stable Incremental Clustering Algorithm. Young, S., Arel, I., Karnowski, T. P., & Rose, D. In 2010 Seventh International Conference on Information Technology: New Generations, pages 204–209, April, 2010. doi abstract bibtex Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or batch) processing, in which the clustering process repeatedly sweeps through a set of data samples in an attempt to capture its underlying structure in a compact and efficient way. However, many recent applications require that the clustering algorithm be online, or incremental, in the that there is no a priori set of samples to process but rather samples are provided one iteration at a time. Accordingly, the clustering algorithm is expected to gradually improve its prototype (or centroid) constructs. Several problems emerge in this context, particularly relating to the stability of the process and its speed of convergence. In this paper, we present a fast and stable incremental clustering algorithm, which is computationally modest and imposes minimal memory requirements. Simulation results clearly demonstrate the advantages of the proposed framework in a variety of practical scenarios.
@inproceedings{young_fast_2010,
title = {A {Fast} and {Stable} {Incremental} {Clustering} {Algorithm}},
doi = {10.1109/ITNG.2010.148},
abstract = {Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or batch) processing, in which the clustering process repeatedly sweeps through a set of data samples in an attempt to capture its underlying structure in a compact and efficient way. However, many recent applications require that the clustering algorithm be online, or incremental, in the that there is no a priori set of samples to process but rather samples are provided one iteration at a time. Accordingly, the clustering algorithm is expected to gradually improve its prototype (or centroid) constructs. Several problems emerge in this context, particularly relating to the stability of the process and its speed of convergence. In this paper, we present a fast and stable incremental clustering algorithm, which is computationally modest and imposes minimal memory requirements. Simulation results clearly demonstrate the advantages of the proposed framework in a variety of practical scenarios.},
booktitle = {2010 {Seventh} {International} {Conference} on {Information} {Technology}: {New} {Generations}},
author = {Young, Steven and Arel, Itamar and Karnowski, Thomas P. and Rose, Derek},
month = apr,
year = {2010},
keywords = {Clustering algorithms, Information technology, cluster stability},
pages = {204--209},
}
Downloads: 0
{"_id":"sPij4GCHLePm2bPLk","bibbaseid":"young-arel-karnowski-rose-afastandstableincrementalclusteringalgorithm-2010","downloads":0,"creationDate":"2016-01-26T15:11:00.463Z","title":"A Fast and Stable Incremental Clustering Algorithm","author_short":["Young, S.","Arel, I.","Karnowski, T. P.","Rose, D."],"year":2010,"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"A Fast and Stable Incremental Clustering Algorithm","doi":"10.1109/ITNG.2010.148","abstract":"Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or batch) processing, in which the clustering process repeatedly sweeps through a set of data samples in an attempt to capture its underlying structure in a compact and efficient way. However, many recent applications require that the clustering algorithm be online, or incremental, in the that there is no a priori set of samples to process but rather samples are provided one iteration at a time. Accordingly, the clustering algorithm is expected to gradually improve its prototype (or centroid) constructs. Several problems emerge in this context, particularly relating to the stability of the process and its speed of convergence. In this paper, we present a fast and stable incremental clustering algorithm, which is computationally modest and imposes minimal memory requirements. Simulation results clearly demonstrate the advantages of the proposed framework in a variety of practical scenarios.","booktitle":"2010 Seventh International Conference on Information Technology: New Generations","author":[{"propositions":[],"lastnames":["Young"],"firstnames":["Steven"],"suffixes":[]},{"propositions":[],"lastnames":["Arel"],"firstnames":["Itamar"],"suffixes":[]},{"propositions":[],"lastnames":["Karnowski"],"firstnames":["Thomas","P."],"suffixes":[]},{"propositions":[],"lastnames":["Rose"],"firstnames":["Derek"],"suffixes":[]}],"month":"April","year":"2010","keywords":"Clustering algorithms, Information technology, cluster stability","pages":"204–209","bibtex":"@inproceedings{young_fast_2010,\n\ttitle = {A {Fast} and {Stable} {Incremental} {Clustering} {Algorithm}},\n\tdoi = {10.1109/ITNG.2010.148},\n\tabstract = {Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or batch) processing, in which the clustering process repeatedly sweeps through a set of data samples in an attempt to capture its underlying structure in a compact and efficient way. However, many recent applications require that the clustering algorithm be online, or incremental, in the that there is no a priori set of samples to process but rather samples are provided one iteration at a time. Accordingly, the clustering algorithm is expected to gradually improve its prototype (or centroid) constructs. Several problems emerge in this context, particularly relating to the stability of the process and its speed of convergence. In this paper, we present a fast and stable incremental clustering algorithm, which is computationally modest and imposes minimal memory requirements. Simulation results clearly demonstrate the advantages of the proposed framework in a variety of practical scenarios.},\n\tbooktitle = {2010 {Seventh} {International} {Conference} on {Information} {Technology}: {New} {Generations}},\n\tauthor = {Young, Steven and Arel, Itamar and Karnowski, Thomas P. and Rose, Derek},\n\tmonth = apr,\n\tyear = {2010},\n\tkeywords = {Clustering algorithms, Information technology, cluster stability},\n\tpages = {204--209},\n}\n\n\n\n","author_short":["Young, S.","Arel, I.","Karnowski, T. P.","Rose, D."],"key":"young_fast_2010","id":"young_fast_2010","bibbaseid":"young-arel-karnowski-rose-afastandstableincrementalclusteringalgorithm-2010","role":"author","urls":{},"keyword":["Clustering algorithms","Information technology","cluster stability"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["fast","stable","incremental","clustering","algorithm","young","arel","karnowski","rose"],"keywords":["clustering algorithms","information technology","cluster stability"],"authorIDs":[],"dataSources":["KPN3ak3bwBm6iLG2r","XJ7Gu6aiNbAiJAjbw","XvjRDbrMBW2XJY3p9","3C6BKwtiX883bctx4","5THezwiL4FyF8mm4G","RktFJE9cDa98BRLZF","qpxPuYKLChgB7ox6D","PfM5iniYHEthCfQDH","iwKepCrWBps7ojhDx"]}