Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A spectral method to separate disconnected and nearly-disconnected web graph components
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Email as spectroscopy: automated discovery of community structure within organizations
Communities and technologies
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problems
The Journal of Machine Learning Research
Community evolution in dynamic multi-mode networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A Fast Algorithm to Find Overlapping Communities in Networks
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Searching for Rising Stars in Bibliography Networks
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Tractable models for information diffusion in social networks
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
| Hi-index | 0.00 |
People regularly attend various social events to interact with other community members. For example, researchers attend conferences to present their work and to network with other researchers. In this paper, we propose an Event-based COmmunity DEtection algorithm ECODE to mine the underlying community substructures of social networks from event information. Unlike conventional approaches, ECODE makes use of content similarity-based virtual links which are found to be more useful for community detection than the physical links. By performing partial computation between an event and its candidate relevant set instead of computing pair-wise similarities between all the events, ECODE is able to achieve significant computational speedup. Extensive experimental results and comparisons with other existing methods showed that our ECODE algorithm is both efficient and effective in detecting communities from social networks.