Abstract
Social network can be represented by a graph, where individual users are represented as nodes/vertices and connections between them are represented as edges of the graph. The classification of people based on their tastes, choices, likes or dislikes are associated with each other, forms a virtual cluster or community. The basis of a better community detection algorithm refers to within the community the interaction will be maximized and with other community the interaction will be minimized. In this paper, we are proposing an ego based community detection algorithm and compared with three most popular hierarchical community detection algorithms, namely edge betweenness, label propagation and walktrap and compare them in terms of modularity, transitivity, average path length and time complexity. A network is formed based on the data collected from a Twitter account, using Node-XL and I-graph and data are processed in R based Hadoop framework.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
He, L., Lu, C.T., Ma, J., Cao, J., Shen, L., Yu, P.S.: Joint community and structural hole spanner detection via harmonic modularity. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, pp. 875–884, New York, NY, USA (2016). http://doi.acm.org/10.1145/2939672.2939807
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
Pons, P., Latapy, M.: Computing communities in large networks using random walks. J. Graph Algorithm Appl. 10(2), 191–218 (2006)
Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76, 036106 (2007). https://link.aps.org/doi/10.1103/PhysRevE.76.036106
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Dey, P., Roy, S., Roy, S. (2018). Ego Based Community Detection in Online Social Network. In: Negi, A., Bhatnagar, R., Parida, L. (eds) Distributed Computing and Internet Technology. ICDCIT 2018. Lecture Notes in Computer Science(), vol 10722. Springer, Cham. https://doi.org/10.1007/978-3-319-72344-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-72344-0_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-72343-3
Online ISBN: 978-3-319-72344-0
eBook Packages: Computer ScienceComputer Science (R0)