Distributed Louvain Algorithm for Graph Community Detection

In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be "related" to one another than they are to the rest of the network. The goodness of partitioning into com...

Celý popis

Podrobná bibliografie

Vydáno v:	2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS) s. 885 - 895
Hlavní autoři:	Ghosh, Sayan, Halappanavar, Mahantesh, Tumeo, Antonino, Kalyanaraman, Ananth, Lu, Hao, Chavarria-Miranda, Daniel, Khan, Arif, Gebremedhin, Assefaw
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.05.2018
Témata:	Community detection Distributed graph clustering Heuristic algorithms Image edge detection Iterative methods Mathematical model Optimization Parallel algorithms Parallel graph heuristics Parallel Louvain Synchronization
ISSN:	1530-2075
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!