Abstract
Deriving networks and communities from individual and group attributes is an important task in understanding social groups and relations. In this work we propose a novel methodology to derive networks and communities from socio-cultural data. Our methodology is based on socio-cultural cognitive mapping (SCM) and k-NN network modularity maximization (SCM + k-NN) that produces both a latent network and community assignments of entities based upon their socio-cultural and behavioral attributes. We apply this methodology to two real-world data sets and compare the community assignments by our methodology to those communities found by k-Means, Gaussian Mixture Models, and Affinity Propagation. We then analyze the latent networks that are created by SCM + k-NN to derive novel insight into the nature of the communities. The community assignments found by SCM + k-NN are comparable to those produced by current unsupervised machine learning techniques. Additionally, in contrast to current unsupervised machine learning techniques SCM + k-NN also produces a latent network that gives additional insight into community relationships.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Levine, J.H., Carley, K.M.: SCM system. Technical Report. CMU-ISR-16-108, Institute for Software Research, Carnegie Mellon University (June 2016). http://reports-archive.adm.cs.cmu.edu/anon/isr2016/CMU-ISR-16-108.pdf
Morgan, G.P., Levine, J., Carley, K.M.: Socio-cultural cognitive mapping. In: Lee, D., Lin, Y.R., Osgood, N., Thomson, R. (eds.) Social, Cultural, and Behavioral Modeling, pp. 71–76. Springer International Publishing, Cham (2017)
Ruan, J.: A fully automated method for discovering community structures in high dimensional data. In: 2009 Ninth IEEE International Conference on Data Mining, pp. 968–973 (Dec 2009). https://doi.org/10.1109/ICDM.2009.141
Barabsi, A.L.: Network Science. Cambridge University Press, Cambridge (2015). http://networksciencebook.com/
Snijders, T.A.B., Lazega, E.: Multilevel Network Analysis for the Social Sciences. Springer, Cham (2016)
Kim, B., Lee, K., Xue, L., Niu, X.: A review of dynamic network models with latent variables (2018). arXiv. https://arxiv.org/pdf/1711.10421.pdf
Hoff, P.D., Raftery, A.E., Handcock, M.S.: Latent space approaches to social network analysis. J. Am. Stat. Assoc. 97(460), 1090–1098 (2002). https://doi.org/10.1198/016214502388618906
Leskovec, J., Lang, K.J., Mahoney, M.W.: Empirical comparison of algorithms for network community detection. CoRR abs/1004.3539 (2010). http://arxiv.org/abs/1004.3539
Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)
Schaub, M.T., Delvenne, J., Rosvall, M., Lambiotte, R.: The many facets of community detection in complex networks. CoRR abs/1611.07769 (2016). http://arxiv.org/abs/1611.07769
Jolliffe, I.: Principal Component Analysis. American Cancer Society (2005). https://doi.org/10.1002/0470013192.bsa501, https://onlinelibrary.wiley.com/doi/abs/10.1002/0470013192.bsa501
van der Maaten, L., Hinton, G.: Visualizing high-dimensional data using t-SNE. J. Mach. Learn. Res. 9, 2579–2605 (2008)
Maier, M., Hein, M., von Luxburg, U.: Optimal construction of k-nearest neighbor graphs for identifying noisy clusters. Theor. Comput. Sci. 410(19), 1749–1764 (2009). https://arxiv.org/abs/0912.3408
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 10 (2008). http://arxiv.org/abs/0803.0476
Pelleg, D., Moore, A.: X-means: extending k-means with efficient estimation of the number of clusters. In: In Proceedings of the 17th International Conference on Machine Learning, pp. 727–734. Morgan Kaufmann, San Francisco (2000)
Marin, J.M., Mengersen, K.L., Robert, C.: Bayesian modelling and inference on mixtures of distributions. In: Dey, D., Rao, C. (eds.) Handbook of Statistics, vol. 25. Elsevier, Amsterdam (2005). https://eprints.qut.edu.au/901/
Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972–976 (2007). https://doi.org/10.1126/science.1136800, http://science.sciencemag.org/content/315/5814/972
Center for Computational Analysis of Social and Organizational Systems: ORA (June 2018). http://www.casos.cs.cmu.edu/projects/ora/
Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193–218 (1985). https://doi.org/10.1007/BF01908075,
Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987). https://doi.org/10.1016/0377-0427(87)90125-7, http://www.sciencedirect.com/science/article/pii/0377042787901257
Center for Computational Analysis of Social and Organizational Systems: Public datasets (April 2018). https://www.casos.cs.cmu.edu/tools/datasets/external/index.php
Verkhovna Rada of Ukraine: 8th convocation (February 2018). http://rada.gov.ua/en
Acknowledgements
This material is based upon work supported by the National Science Foundation Graduate Research Fellowship (DGE 1745016), Department of Defense Minerva Initiative (N00014-15-1-2797), and Office of Naval Research Multidisciplinary University Research Initiative (N00014-17-1-2675). Any opinion, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation, Department of Defense, or the Office of Naval Research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Cruickshank, I., Carley, K.M. (2020). Socio-Cultural Cognitive Mapping to Identify Communities and Latent Networks. In: Ragozini, G., Vitale, M. (eds) Challenges in Social Network Research. Lecture Notes in Social Networks. Springer, Cham. https://doi.org/10.1007/978-3-030-31463-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-31463-7_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31462-0
Online ISBN: 978-3-030-31463-7
eBook Packages: Computer ScienceComputer Science (R0)