• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A new clustering algorithm based on the connected region generation

Vol. 12, No. 6, June 29, 2018
10.3837/tiis.2018.06.010 , Download Paper (Free):

Abstract

In this paper, a new clustering algorithm based on the connected region generation (CRG-clustering) is proposed. It is an effective and robust approach to clustering on the basis of the connectivity of the points and their neighbors. In the new algorithm, a connected region generating (CRG) algorithm is developed to obtain the connected regions and an isolated point set. Each connected region corresponds to a homogeneous cluster and this ensures the separability of an arbitrary data set theoretically. Then, a region expansion strategy and a consensus criterion are used to deal with the points in the isolated point set. Experimental results on the synthetic datasets and the real world datasets show that the proposed algorithm has high performance and is insensitive to noise.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
L. Feng, D. Chang, Y. Zhao, "A new clustering algorithm based on the connected region generation," KSII Transactions on Internet and Information Systems, vol. 12, no. 6, pp. 2619-2643, 2018. DOI: 10.3837/tiis.2018.06.010 .

[ACM Style]
Liuwei Feng, Dongxia Chang, and Yao Zhao. 2018. A new clustering algorithm based on the connected region generation. KSII Transactions on Internet and Information Systems, 12, 6, (2018), 2619-2643. DOI: 10.3837/tiis.2018.06.010 .

[BibTeX Style]
@article{tiis:21784, title="A new clustering algorithm based on the connected region generation", author="Liuwei Feng and Dongxia Chang and Yao Zhao and ", journal="KSII Transactions on Internet and Information Systems", DOI={10.3837/tiis.2018.06.010 }, volume={12}, number={6}, year="2018", month={June}, pages={2619-2643}}