Community Detection in Partially Observable Social Networks

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

TRAN, Cong, Won-Yong SHIN, Andreas SPITZ, 2022. Community Detection in Partially Observable Social Networks. In: ACM Transactions on Knowledge Discovery from Data. Association for Computing Machinery (ACM). 16(2), 22. ISSN 1556-4681. eISSN 1556-472X. Available under: doi: 10.1145/3461339

@article{Tran2022Commu-55113, title={Community Detection in Partially Observable Social Networks}, year={2022}, doi={10.1145/3461339}, number={2}, volume={16}, issn={1556-4681}, journal={ACM Transactions on Knowledge Discovery from Data}, author={Tran, Cong and Shin, Won-Yong and Spitz, Andreas}, note={Article Number: 22} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:date rdf:datatype="">2021-10-01T07:49:25Z</dc:date> <dcterms:title>Community Detection in Partially Observable Social Networks</dcterms:title> <dc:contributor>Tran, Cong</dc:contributor> <dc:creator>Shin, Won-Yong</dc:creator> <dcterms:isPartOf rdf:resource=""/> <dc:creator>Tran, Cong</dc:creator> <dcterms:available rdf:datatype="">2021-10-01T07:49:25Z</dcterms:available> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:issued>2022</dcterms:issued> <dc:contributor>Shin, Won-Yong</dc:contributor> <bibo:uri rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Spitz, Andreas</dc:contributor> <dc:language>eng</dc:language> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:abstract xml:lang="eng">The discovery of community structures in social networks has gained significant attention since it is a fundamental problem in understanding the networks’ topology and functions. However, most social network data are collected from partially observable networks with both missing nodes and edges. In this article, we address a new problem of detecting overlapping community structures in the context of such an incomplete network, where communities in the network are allowed to overlap since nodes belong to multiple communities at once. To solve this problem, we introduce KroMFac, a new framework that conducts community detection via regularized nonnegative matrix factorization (NMF) based on the Kronecker graph model. Specifically, from an inferred Kronecker generative parameter matrix, we first estimate the missing part of the network. As our major contribution to the proposed framework, to improve community detection accuracy, we then characterize and select influential nodes (which tend to have high degrees) by ranking, and add them to the existing graph. Finally, we uncover the community structures by solving the regularized NMF-aided optimization problem in terms of maximizing the likelihood of the underlying graph. Furthermore, adopting normalized mutual information (NMI), we empirically show superiority of our KroMFac approach over two baseline schemes by using both synthetic and real-world networks.</dcterms:abstract> <dc:creator>Spitz, Andreas</dc:creator> </rdf:Description> </rdf:RDF>

This item appears in the following Collection(s)

Search KOPS


My Account