Abstract
Non-negative Matrix Factorization technique has attracted many interests in overlapping community detection due to its performance and interpretability. However, when adapted to discover community structure the intrinsic geometric information of the network graph is seldom considered. In view of this, we proposed a novel NMF based algorithm called Graph regularized nonnegative matrix tri-factorization (GNMTF) model, which incorporates the intrinsic geometrical properties of the network graph by manifold regularization. Moreover, by using three factor matrices we can not only explicitly obtain the community membership of each node but also learn the interaction among different communities. The experimental results on two well-known real world networks and a benchmark network demonstrate the effectiveness of the algorithm over the representative non-negative matrix factorization based method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
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.
