Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79731
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorHe, TT-
dc.creatorHu, L-
dc.creatorChan, KCC-
dc.creatorHu, PW-
dc.date.accessioned2018-12-21T07:13:13Z-
dc.date.available2018-12-21T07:13:13Z-
dc.identifier.issn2169-3536en_US
dc.identifier.urihttp://hdl.handle.net/10397/79731-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2018 IEEE. Translations and content mining are permitted for academic research only. Personal use is also permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.en_US
dc.rightsPosted with permission of the publisher.en_US
dc.rightsThe following publication He, T. T., Hu, L., Chan, K. C. C., & Hu, P. W.(2018). Learning latent factors for community identification and summarization. IEEE Access, 6, 30137-30148 is available at https://dx.doi.org/10.1109/ACCESS.2018.2843726en_US
dc.subjectNetwork analysisen_US
dc.subjectSocial networken_US
dc.subjectComplex networken_US
dc.subjectGraph clusteringen_US
dc.subjectCommunity detectionen_US
dc.subjectCommunity summarizationen_US
dc.subjectLatent factor analysisen_US
dc.titleLearning latent factors for community identification and summarizationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage30137en_US
dc.identifier.epage30148en_US
dc.identifier.volume6en_US
dc.identifier.doi10.1109/ACCESS.2018.2843726en_US
dcterms.abstractNetwork communities, which are also known as network clusters, are typical latent structures in network data. Vertices in each of these communities tend to interact more and share similar features with each other. Community identification and feature summarization are significant tasks of network analytics. To perform either of the two tasks, there have been several approaches proposed, taking into the consideration of different categories of information carried by the network, e.g., edge structure, node attributes, or both aforementioned. But few of them are able to discover communities and summarize their features simultaneously. To address this challenge, we propose a novel latent factor model for community identification and summarization (LFCIS). To perform the task, the LFCIS first formulates an objective function that evaluating the overall clustering quality taking into the consideration of both edge topology and node features in the network. In the objective function, the LFCIS also adopts an effective component that ensures those vertices sharing with both similar local structures and features to be located into the same clusters. To identify the optimal cluster membership for each vertex, a convergent algorithm for updating the variables in the objective function is derived and used by LFCIS. The LFCIS has been tested with six sets of network data, including synthetic and real networks, and compared with several state-of-the-art approaches. The experimental results show that the LFCIS outperforms most of the prevalent approaches to community discovery in social networks, and the LFCIS is able to identify the latent features that may characterize those discovered communities.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIEEE access, 2018, v. 6, p. 30137-30148-
dcterms.isPartOfIEEE access-
dcterms.issued2018-
dc.identifier.isiWOS:000435522600059-
dc.identifier.scopus2-s2.0-85048152068-
dc.identifier.rosgroupid2017005675-
dc.description.ros2017-2018 > Academic research: refereed > Publication in refereed journal-
dc.description.validate201812 bcrcen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
He_Learning_Latent_Factors.pdf9.83 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

113
Last Week
2
Last month
Citations as of Apr 14, 2024

Downloads

113
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

16
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
Citations as of Apr 18, 2024

Google ScholarTM

Check

Altmetric


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