A complex networks approach for data clustering


Autoria(s): Arruda, Guilherme F. de; Costa, Luciano da Fontoura; Rodrigues, Francisco A.
Contribuinte(s)

UNIVERSIDADE DE SÃO PAULO

Data(s)

17/09/2013

17/09/2013

2012

Resumo

This work proposes a method for data clustering based on complex networks theory. A data set is represented as a network by considering different metrics to establish the connection between each pair of objects. The clusters are obtained by taking into account five community detection algorithms. The network-based clustering approach is applied in two real-world databases and two sets of artificially generated data. The obtained results suggest that the exponential of the Minkowski distance is the most suitable metric to quantify the similarities between pairs of objects. In addition, the community identification method based on the greedy optimization provides the best cluster solution. We compare the network-based clustering approach with some traditional clustering algorithms and verify that it provides the lowest classification error rate. (C) 2012 Elsevier B.V. All rights reserved.

CNPq

CNPq [305940/2010-4, 301303/06-1, 573583/2008-0]

FAPESP [2010/19440-2, 05/00587-5]

FAPESP

Identificador

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, AMSTERDAM, v. 391, n. 23, supl., Part 3, pp. 6174-6183, DEC 1, 2012

0378-4371

http://www.producao.usp.br/handle/BDPI/33415

10.1016/j.physa.2012.07.007

http://dx.doi.org/10.1016/j.physa.2012.07.007

Idioma(s)

eng

Publicador

ELSEVIER SCIENCE BV

AMSTERDAM

Relação

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS

Direitos

restrictedAccess

Copyright ELSEVIER SCIENCE BV

Palavras-Chave #CLUSTERING #COMPLEX NETWORKS #PATTERN RECOGNITION #COMMUNITY #COMMUNITY STRUCTURE #RANDOM-WALKS #RESOLUTION #PHYSICS, MULTIDISCIPLINARY
Tipo

article

original article

publishedVersion