Aviso: para depositar documentos, por favor, inicia sesión e identifícate con tu cuenta de correo institucional de la UCM con el botón MI CUENTA UCM. No emplees la opción AUTENTICACIÓN CON CONTRASEÑA
 

A Spark parallel betweenness centrality computation and its application to community detection problems

Simple item page
dc.contributor.authorGómez González, Daniel
dc.contributor.authorLlana Díaz, Luis Fernando
dc.contributor.authorPareja Flores, Cristóbal
dc.date.accessioned2024-12-10T13:38:19Z
dc.date.available2024-12-10T13:38:19Z
dc.date.issued2022-02
dc.description.abstractThe Brandes algorithm has the lowest computational complexity for computing the betweenness centrality measures of all nodes or edges in a given graph. Its numerous applications make it one of the most used algorithms in social network analysis. In this work, we provide a parallel version of the algorithm implemented in Spark. The experimental results show that the parallel algorithm scales as the number of cores increases. Finally, we provide a version of the well-known community detection Girvan-Newman algorithm, based on the Spark version of Brandes algorithm.
dc.description.departmentDepto. de Sistemas Informáticos y Computación
dc.description.facultyFac. de Estudios Estadísticos
dc.description.refereedTRUE
dc.description.sponsorshipAgencia estatal de investigación
dc.description.sponsorshipComunidad de Madrid
dc.description.sponsorshipUnión Europea
dc.description.statuspub
dc.identifier.citationGomez González, Daniel, et al. “A Spark Parallel Betweenness Centrality Computation and its Application to Community Detection Problems”. JUCS - Journal of Universal Computer Science, vol. 28, núm. 2, febrero de 2022, pp. 160–80. DOI.org (Crossref), https://doi.org/10.3897/jucs.80688
dc.identifier.doi10.3897/jucs.80688
dc.identifier.essn0948-6968
dc.identifier.issn0948-695X
dc.identifier.officialurlhttps://doi.org/10.3897/jucs.80688
dc.identifier.relatedurlhttps://lib.jucs.org/article/80688/
dc.identifier.urihttps://hdl.handle.net/20.500.14352/112337
dc.issue.number2
dc.journal.titleJournal of Universal Computer Science
dc.language.isoeng
dc.page.final180
dc.page.initial160
dc.publisherGraz University of Technology
dc.relation.projectIDRTI2018-093608-B-C3
dc.relation.projectIDS2018/TCS-4314
dc.relation.projectIDS2018/TCS-4314
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalen
dc.rights.accessRightsopen access
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject.cdu004
dc.subject.keywordSpark
dc.subject.keywordMapReduce
dc.subject.keywordSocial Network Analysis
dc.subject.keywordCentrality measure
dc.subject.keywordBrandes Algorithm
dc.subject.keywordDistributed programming
dc.subject.ucmInformática (Informática)
dc.subject.unesco1203.17 Informática
dc.titleA Spark parallel betweenness centrality computation and its application to community detection problems
dc.typejournal article
dc.type.hasVersionVoR
dc.volume.number28
dspace.entity.typePublication
relation.isAuthorOfPublication4dcf8c54-8545-4232-8acf-c163330fd0fe
relation.isAuthorOfPublication680f556a-4f1b-4eda-9add-da2c9b24796a
relation.isAuthorOfPublication878b6501-e418-44db-83d1-724069085472
relation.isAuthorOfPublication.latestForDiscovery4dcf8c54-8545-4232-8acf-c163330fd0fe

Download

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
A Spark Paralle
Size:
986.16 KB
Format:
Adobe Portable Document Format
downoload Download

Collections

Artículos