Please use this identifier to cite or link to this item: http://ir.futminna.edu.ng:8080/jspui/handle/123456789/9582
Full metadata record
DC FieldValueLanguage
dc.contributor.authorOnwuka, Elizabeth N-
dc.contributor.authorSalihu, Bala A.-
dc.contributor.authorIornenge, Paschal S-
dc.date.accessioned2021-07-15T11:53:11Z-
dc.date.available2021-07-15T11:53:11Z-
dc.date.issued2016-
dc.identifier.citationE. N. Onwuka, B. A. Salihu, and P. S. Iornenge, “Community detection in networks: Algorithms and challenges,” in CEUR Workshop Proceedings, 2016, vol. 1830, no. Icta, pp. 208–212.en_US
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/9582-
dc.description.abstractCommunity detection in networks is a research area that is gaining a lot of attention mostly because of its great applications in areas such a coding, link prediction, routing, containment of virus and warm online, and recently for criminal detection. In this era of Big Data, it is envisaged that community detection will be handy in solving many societal problems. Many algorithms have been developed to solve the complex problem of clustering groups of nodes in a network. In this paper, a few of these algorithms and their challenges are discussed. Directions for future research in this area are also pointed out.en_US
dc.language.isoenen_US
dc.subjectBinary networksen_US
dc.subjectCommunity detectionen_US
dc.subjectSocial network graphsen_US
dc.subjectWeighted networksen_US
dc.titleCommunity detection in networks: Algorithms and challengesen_US
dc.typeArticleen_US
Appears in Collections:Telecommunication Engineering



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.