Abstract
Inspired by the fact that normalized graph Laplacian is superior to the non-normalized one in spectral clustering, in this paper we develop a new symmetric matrix called normalized modularity matrix which has different properties with the normalized graph Laplacian. And thus a new spectral clustering algorithm is derived based on this new matrix. Experimental results show the performance of the proposed algorithm: (1) being helpful in detecting intrinsic cluster number, (2) being competitive to two baseline algorithms.
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 callDisclaimer: 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.
