Abstract
Social network analysis is aimed at analyzing relationships between social network users. Such analysis aims at finding community detection, that is, group of closest people in a network. Usually, graph clustering techniques are used to identify groups. Here, we propose a computational geometric approach to analyze social network. A Voronoi diagram-based clustering algorithm is employed over embedded dataset in the Euclidean vector space to identify groups. Structure-preserving embedding technique is used to embed the social network dataset and learns a low-rank kernel matrix by means of a semi-definite program with linear constraints that captures the connectivity structure of the input graph.
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
I-Hsien Ting, “Web Mining Techniques for On-line Social Networks Analysis”. Fifth IEEE international conference service systems and service management, 2008, pp. 1–5.
Brandes, U., Gaertler, M., and Wagner, D. 2007. Engineering graph clustering: Models and experimental evaluation. Journal of Experimental Algorithmics (JEA).Vol.12, Article 1.1 (2008).
Newman, M. E. J. “Fast algorithm for detecting community structure in networks”, Physical Review -Series E, Vol 69; Part 6; Part 2, pages 066133 (2004) [5 pages].
Vempala S., Kannan R., and Vetta A., “On clusterings good, bad and spectral”, In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS00). pp. 367–378.
M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks”. Physical Review -Series E Vol. 69, pages 026113 (2004) [15 pages].
Charu C Aggarwal, Haixun Wang, “Managing and Mining Graph Data”, Advances in Database Systems, Springer Science + Business Media, Chapter 16, pp. 487–513, 2010.
Aaron Clauset, M. E. J. Newman, and Cristopher Moore, “Finding community structure in very large networks”. Phys. Rev. E Vol. 70, 066111. (2004) [6 pages].
MEJ Newman, “Power laws, Pareto distributions and Zipf’s law”. Contemporary Physics 46:5, 323–351, 2005.
J.Travers and S.Milgram, “An experimental study of the small world problem”. Sociometry, 32(4):425-443, 1969.
B. W. Kernighan and S. Lin “An efficient heuristic procedure for partitioning graphs”, Bell System Technical Journal, vol. 49, pp. 291–307 1970.
Earl R. Barnes, “An Algorithm for Partitioning the Nodes of a Graph”, SIAM. J. on Algebraic and Discrete Methods, 3(4), 541550,1982.
Ford L. R., and Fulkerson D. R., “Maximal flow through a network”, Can. J. Math 8, 399–404, 1956.
M. E. J. Newman, “Modularity and community structure in networks”, Proceedings of National Academy of Sciences of the USA, Vol. 103 no. 23 pp. 8577–8582, 2006.
Rattigan, M. J., M. Maier, and D. Jensen, “Graph clustering with network structure indices”, ICML’07 Proceedings of the 24th international conference on Machine learning, (ACM, New York, NY, USA), pp. 783–790, 2007.
Brandes, U., D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikolski, and D. Wagner, 2006, URL http://digbib.ubka.unikarlsruhe.de/volltexte/documents/3255.
Van Dongen, S. M., “Graph Clustering by Flow Simulation”. Ph.D. thesis, University of Utrecht, 2000.
David Harel, Yehuda Koren, On clustering using random walks. In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer S. Lecture Notes in Computer Science, vol. 2245. Springer-Verlag, New York. 1841, 2001.
Preparata F. P., M. I. Shamos, “Computational Geometry-An Introduction”, Springer-Verlag, August 1985.
Blake Shaw, Tony Jebara, “Structure Preserving Embedding”, Proceedings of 26th International Conference on Machine Learning, Montreal, Canada, 2009.
Andrea Lancichinetti, Santo Fortunato, “Community detection algorithms: A comparative analysis”, Physical Review E, vol. 80, Issue 5, id. 056117, 2009.
Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi, “Benchmark graphs for testing community detection algorithms”, Physical Review E, 78, 046110, 2008.
Gary Flake, Steve Lawrence, C. Lee Giles, Frans Coetzee, “Self-Organization and Identification of Web Communities”, IEEE Computer, 35(3), 66–71, 2002.
W. W. Zachary, “An information flow model for conflict and fission in small groups”, Journal of Anthropological Research 33, 452–473 (1977).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Surendran, S., Chitraprasad, D., Kaimal, M.R. (2014). Voronoi Diagram-Based Geometric Approach for Social Network Analysis. In: Krishnan, G., Anitha, R., Lekshmi, R., Kumar, M., Bonato, A., Graña, M. (eds) Computational Intelligence, Cyber Security and Computational Models. Advances in Intelligent Systems and Computing, vol 246. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1680-3_39
Download citation
DOI: https://doi.org/10.1007/978-81-322-1680-3_39
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1679-7
Online ISBN: 978-81-322-1680-3
eBook Packages: EngineeringEngineering (R0)