The Community for Technology Leaders
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) (2010)
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
ISBN: 978-1-4244-5445-7
pp: 992-995
Arnau Padrol-Sureda , Departament de Matemàtica Aplicada II, Universitat Politécnica de Catalunya, C/Jordi Girona, 1-3, 08034 Barcelona, Catalonia, Spain
Guillem Perarnau-Llobet , DAMA-UPC, Universitat Politécnica de Catalunya, C/Jordi Girona, 1-3, 08034 Barcelona, Catalonia, Spain
Julian Pfeifle , Departament de Matemàtica Aplicada II, Universitat Politécnica de Catalunya, C/Jordi Girona, 1-3, 08034 Barcelona, Catalonia, Spain
Victor Muntes-Mulero , DAMA-UPC, Universitat Politécnica de Catalunya, C/Jordi Girona, 1-3, 08034 Barcelona, Catalonia, Spain
ABSTRACT
Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes, real-world datasets suggest the presence of overlapping communities. We present OCA, a novel algorithm to detect overlapped communities in large data graphs. It outperforms previous proposals in terms of execution time, and efficiently handles large graphs containing more than 10<sup>8</sup> nodes and edges.
INDEX TERMS
CITATION

J. Pfeifle, V. Muntes-Mulero, G. Perarnau-Llobet and A. Padrol-Sureda, "Overlapping Community Search for social networks," 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)(ICDE), Long Beach, CA, USA, 2010, pp. 992-995.
doi:10.1109/ICDE.2010.5447860
87 ms
(Ver 3.3 (11022016))