A new clustering algorithm based on graph connectivity

3Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new clustering algorithm based on the concept of graph connectivity is introduced. The idea is to develop a meaningful graph representation for data, where each resulting sub-graph corresponds to a cluster with highly similar objects connected by edge. The proposed algorithm has a fairly strong theoretical basis that supports its originality and computational efficiency. Further, some useful guidelines are provided so that the algorithm can be tuned to optimize the well-designed quality indices. Numerical evidences show that the proposed algorithm can provide a very good clustering accuracy for a number of benchmark data and has a relatively low computational complexity compared to some sophisticated clustering methods.

Cite

CITATION STYLE

APA

Li, Y. F., Lu, L. H., & Hung, Y. C. (2019). A new clustering algorithm based on graph connectivity. In Advances in Intelligent Systems and Computing (Vol. 858, pp. 442–454). Springer Verlag. https://doi.org/10.1007/978-3-030-01174-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free