Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
An empirical comparison of algorithms to findcommunities in directed graphs and theirapplication in Web Data Analytics
Department of Mathematics and Computer Science, Physical Sciences and Earth Sciences, University of Messina.
of Ancient and Modern Civilizations, University of Messina.
Department of Mathematics and Computer Science, Physical Sciences and Earth Sciences, University of Messina.
Department of Mathematics and Computer Science, Physical Sciences and Earth Sciences, University of Messina.
Vise andre og tillknytning
2017 (engelsk)Inngår i: IEEE Transactions on Big Data, E-ISSN 2332-7790, Vol. 3, nr 3, s. 289-306Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Detecting communities in graphs is a fundamental tool to understand the structure of Web-based systems and predict their evolution. Many community detection algorithms are designed to process undirected graphs (i.e., graphs with bidirectional edges) but many graphs on the Web - e.g. microblogging Web sites, trust networks or the Web graph itself - are often directed. Few community detection algorithms deal with directed graphs but we lack their experimental comparison. In this paper we evaluated some community detection algorithms across accuracy and scalability. A first group of algorithms (Label Propagation and Infomap) are explicitly designed to manage directed graphs while a second group (e.g., WalkTrap) simply ignores edge directionality; finally, a third group of algorithms (e.g., Eigenvector) maps input graphs onto undirected ones and extracts communities from the symmetrized version of the input graph. We ran our tests on both artificial and real graphs and, on artificial graphs, WalkTrap achieved the highest accuracy, closely followed by other algorithms; Label Propagation has outstanding performance in scalability on both artificial and real graphs. The Infomap algorithm showcased the best trade-off between accuracy and computational performance and, therefore, it has to be considered as a promising tool for Web Data Analytics purposes.

sted, utgiver, år, opplag, sider
2017. Vol. 3, nr 3, s. 289-306
HSV kategori
Forskningsprogram
Distribuerade datorsystem
Identifikatorer
URN: urn:nbn:se:ltu:diva-62866DOI: 10.1109/TBDATA.2016.2631512OAI: oai:DiVA.org:ltu-62866DiVA: diva2:1086630
Merknad

Validerad;2017;Nivå 1;2017-09-21 (inah)

Tilgjengelig fra: 2017-04-03 Laget: 2017-04-03 Sist oppdatert: 2018-01-13bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Søk i DiVA

Av forfatter/redaktør
Vasilakos, Athanasios
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 148 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf