| Títol: | Overlapping community search for social networks |
| Autor: | Padrol Sureda, Arnau
Perarnau Llobet, Guillem
Pfeifle, Julián
Muntés Mulero, Víctor |
| Altres autors/autores: | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
| Editorial: | IEEE Press. Institute of Electrical and Electronics Engineers |
| Matèries: | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
Graph theory
Social networks
Algorithms
Grafs, Teoria de
Xarxes socials
Algorismes |
| Tipus de document: | Conference report |
| Descripció: | 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 108 nodes and edges. |
| Altres identificadors i accés: | Padrol, A. [et al.]. Overlapping community search for social networks. A: IEEE International Conference on Data Engineering. "26th IEEE International Conference on Data Engineering". Long Beach, California: IEEE Press. Institute of Electrical and Electronics Engineers, 2010, p. 992-995.
http://hdl.handle.net/2117/7797
10.1109/ICDE.2010.5447860 |
| Disponible al dipòsit: | E-prints UPC
|
| Comparteix: |
|
Tots els ítems dipositats a UPCommons estan protegits per drets d'autor.
|
