Extracting local community structure from local cores
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Double-sided recommendations: a novel framework for recommender systems
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Influence maximizing and local influenced community detection based on multiple spread model
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
Community detection in Social Media
Data Mining and Knowledge Discovery
Churn Prediction in a Real Online Social Network Using Local CommunIty Analysis
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 0.01 |
There has been much recent research on identifying global community structure in networks. However, most existing approaches require complete information of the graph in question, which is impractical for some networks, e.g. the World Wide Web (WWW). Algorithms for local community detection have been proposed but their results usually contain many outliers. In this paper, we propose a new measure of local community structure, coupled with a two-phase algorithm that extracts all possible candidates first, and then optimizes the community hierarchy. We compare our results with previous methods on real world networks such as the co-purchase network from Amazon. Experimental results verify the feasibility and effectiveness of our approach.