A Limited Incremental Clustering Algorithm with Respect to Cluster Stability
Autor: | Wenxin Yao, Zhiguo Lu, Song Dai, Wenhao Zhu |
---|---|
Rok vydání: | 2016 |
Předmět: |
Mathematical optimization
k-medoids Computer science Correlation clustering Stability (learning theory) computer.software_genre ComputingMethodologies_PATTERNRECOGNITION CURE data clustering algorithm Canopy clustering algorithm FLAME clustering Data mining Cluster analysis computer k-medians clustering |
Zdroj: | Lecture Notes in Computer Science ISBN: 9783319325569 HPCA (China) |
DOI: | 10.1007/978-3-319-32557-6_18 |
Popis: | As one of the important techniques of data analysis, a clustering algorithm is widely used in data mining, image recognition, information extraction, pattern recognition and other fields. In the era of big data, with the rapid development of web applications, much of the data to be processed is characterized by massive and dynamic growth. Under this background, how to cluster the incremental data becomes a challenging problem that clustering algorithms face. In this paper, we proposed a limited incremental clustering algorithm with respect to cluster stability. Based on an assumption that the categories of data are limited, we take advantage of an existing clustering structure and deal with incremental data steadily with respect to cluster stability. Cluster reconstruction will be triggered when the stability does no longer hold or a buffer pool for undetermined data is full. At the end of the paper, we implement the limited incremental clustering algorithm with K-means. Meanwhile, we use an average density of clusters and the global stability to choose a proper value of K. |
Databáze: | OpenAIRE |
Externí odkaz: |