Abstract
Mining topic community in complex networks is of great applicable value. However, most of the existing methods cannot effectively mine topic community in large-scale complex networks because of their weak scalabilities. To rectify this problem, we propose a method called TCMDNMF that is based on the joint nonnegative matrix factorization model. The proposed method can effectively integrate node link and content information to mine topic community. We adopt the gradient descent method as the optimized solution to the topic community mining model. Further, to improve the computing efficiency of TCMDNMF, we use $L_1$ norm as the sparsity regularization term and implement the key algorithms based on the MapReduce distributed computing framework. The results of extensive experiments conducted demonstrate that our method is effective and is highly scalable. Furthermore, it very effectively solves the problem of processing large volumes of data brought by topic community mining in large-scale complex networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.