ECODE: Event-based community detection from social networks

8Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 E vent-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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, X. L., Tan, A., Yu, P. S., & Ng, S. K. (2011). ECODE: Event-based community detection from social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6587 LNCS, pp. 22–37). https://doi.org/10.1007/978-3-642-20149-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free