Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Silk from a sow's ear: extracting usable structures from the Web
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Inferring Web communities from link topology
Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems: links, objects, time and space---structure in hypermedia systems
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Focused crawling: a new approach to topic-specific Web resource discovery
WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Email as spectroscopy: automated discovery of community structure within organizations
Communities and technologies
| Hi-index | 0.00 |
Community structure is an important topological property of network. Being able to discover it can provide invaluable help in exploiting and understanding complex networks. Although many algorithms have been developed to complete this task, they all have advantages and limitations. So the issue of how to detect communities in networks quickly and correctly remains an open challenge. Distinct from the existing works, this paper studies the community structure from the view of network evolution and presents a self-organizing network evolving algorithm for mining communities hidden in complex networks. Compared with the existing algorithm, our approach has three distinct features. First, it has a good classification capability and especially works well with the networks without well-defined community structures. Second, it requires no prior knowledge and is insensitive to the build-in parameters. Finally, it is suitable for not only positive networks but also singed networks containing both positive and negative weights.