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
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Community detection in complex networks using collaborative evolutionary algorithms
ECAL'07 Proceedings of the 9th European conference on Advances in artificial life
Discovering Knowledge-Sharing Communities in Question-Answering Forums
ACM Transactions on Knowledge Discovery from Data (TKDD)
Collaborative community detection in complex networks
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
Tweets Beget Propinquity: Detecting Highly Interactive Communities on Twitter Using Tweeting Links
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Extracting news blog hot topics based on the W2T Methodology
World Wide Web
| Hi-index | 0.00 |
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely related. Extraction of these communities facilitates better understanding of such networks. Community related research has focused on two main problems, community discovery and community identification. Community discovery is the problem of extracting all the communities in a given network whereas community identification is the problem of identifying the community to which a given set of nodes from the network belong. In this paper we first perform a brief survey of the existing community-discovery algorithms and then propose a novel approach to discovering communities using bibliographic metrics. We also test the proposed algorithm on real-world networks and on computer-generated models with known community structures.