Abstract
Detecting communities in complex networks is an important problem. Spectral method has been successfully used to solve data clustering and community detection problems. However getting the proper eigenvectors is usually di‐cult and depends on extra thresholds. In this paper, we devise an efiective method to choose suitable eigenvectors. The method needs no extra thresholds and can get the reasonable communities in the network. Furthermore we can identify the overlapping communities in complex networks by clustering the chosen eigenvectors with fuzzy c-means algorithm. Experimental results show that the algorithm is efiective in detecting communities.
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.
