{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:21:24Z","timestamp":1765232484722,"version":"build-2065373602"},"reference-count":50,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Embedding social network data into a low-dimensional vector space has shown promising performance for many real-world applications, such as node classification, node clustering, link prediction and network visualization. However, the information contained in these vector embeddings remains abstract and hard to interpret. Methods for inspecting embeddings usually rely on visualization methods, which do not work on a larger scale and do not give concrete interpretations of vector embeddings in terms of preserved network properties (e.g., centrality or betweenness measures). In this paper, we study and investigate network properties preserved by recent random walk-based embedding procedures like node2vec, DeepWalk or LINE. We propose a method that applies learning to rank in order to relate embeddings to network centralities. We evaluate our approach with extensive experiments on real-world and artificial social networks. Experiments show that each embedding method learns different network properties. In addition, we show that our graph embeddings in combination with neural networks provide a computationally efficient way to approximate the Closeness Centrality measure in social networks.<\/jats:p>","DOI":"10.3390\/a10040109","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T10:52:25Z","timestamp":1506509545000},"page":"109","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Properties of Vector Embeddings in Social Networks"],"prefix":"10.3390","volume":"10","author":[{"given":"Fatemeh","family":"Salehi Rizi","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]},{"given":"Michael","family":"Granitzer","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematics, University of Passau, 94032 Passau, Germany"}]}],"member":"1968","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1126\/science.1116869","article-title":"Empirical analysis of an evolving social network","volume":"311","author":"Kossinets","year":"2006","journal-title":"Science"},{"key":"ref_2","unstructured":"Romero, D.M., and Kleinberg, J.M. (2010, January 23\u201326). The directed closure process in hybrid social-information networks, with an analysis of link formation on Twitter. Proceedings of the Fourth International Conference on Weblogs and Social Media, ICWSM 2010, Washington, DC, USA."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/1787234.1787254","article-title":"Predicting the popularity of online content","volume":"53","author":"Szabo","year":"2010","journal-title":"Commun. ACM"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Sakaki, T., Okazaki, M., and Matsuo, Y. (2010, January 26\u201330). Earthquake shakes Twitter users: Real-time event detection by social sensors. Proceedings of the 19th international conference on World wide web, ACM, Raleigh, NC, USA.","DOI":"10.1145\/1772690.1772777"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Helic, D., Strohmaier, M., Granitzer, M., and Scherer, R. (2013, January 2\u20134). Models of human navigation in information networks based on decentralized search. Proceedings of the 24th ACM Conference on Hypertext and Social Media, Paris, France.","DOI":"10.1145\/2481492.2481502"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Helic, D., K\u00f6rner, C., Granitzer, M., Strohmaier, M., and Trattner, C. (2012, January 25\u201328). Navigational efficiency of broad vs. narrow folksonomies. Proceedings of the 23rd ACM conference on Hypertext and social media, Milwaukee, WI, USA.","DOI":"10.1145\/2309996.2310008"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/TKDE.2016.2611584","article-title":"Birank: Towards ranking on bipartite graphs","volume":"29","author":"He","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","first-page":"4","article-title":"Unifying virtual and physical worlds: Learning toward local and global consistency","volume":"36","author":"Wang","year":"2017","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Asur, S., and Huberman, B.A. (September, January 31). Predicting the Future with Social Media. Proceedings of the 2010 IEEE\/WIC\/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Toronto, ON, Canada.","DOI":"10.1109\/WI-IAT.2010.63"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Grover, A., and Leskovec, J. (2016, January 24\u201327). node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939754"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Shaw, B., and Jebara, T. (2009, January 14\u201318). Structure Preserving Embedding. Proceedings of the 26th Annual International Conference on Machine Learning, ICML \u201909, Montreal, QC, Canada.","DOI":"10.1145\/1553374.1553494"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24\u201327). Deepwalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623732"},{"key":"ref_13","unstructured":"Mikolov, T., Chen, K., Corrado, G., and Dean, J. (arXiv, 2013). Efficient estimation of word representations in vector space, arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., and Mei, Q. (2015, January 18\u201322). Line: Large-scale information network embedding. Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, Florence, Italy.","DOI":"10.1145\/2736277.2741093"},{"key":"ref_15","unstructured":"Fatemeh Salehi Rizi, M.G., and Ziegler, K. (2017, January 28\u201331). Global and Local Feature Learning for Ego-Network Analysis. Proceedings of the 14th International Workshop on Technologies for Information Retrieval (TIR), Lyon, France."},{"key":"ref_16","unstructured":"Le, Q., and Mikolov, T. (2014, January 21\u201326). Distributed representations of sentences and documents. Proceedings of the 31st International Conference on Machine Learning (ICML-14), Beijing, China."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/2556612","article-title":"Discovering social circles in ego networks","volume":"8","author":"Mcauley","year":"2014","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_18","unstructured":"Ding, C.H., He, X., Zha, H., Gu, M., and Simon, H.D. (December, January 29). A min-max cut algorithm for graph partitioning and data clustering. Proceedings of the 2001 IEEE International Conference on Data Mining, San Jose, CA, USA."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Kleinberg","year":"2007","journal-title":"J. Assoc. Inf. Sci. Technol."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Ziegler, K., Caelen, O., Garchery, M., Granitzer, M., He-Guelton, L., Jurgovsky, J., Portier, P.E., and Zwicklbauer, S. (2017, January 21\u201323). Injecting Semantic Background Knowledge into Neural Networks using Graph Embeddings. Proceedings of the 2017 IEEE 26th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE), Poznan, Poland.","DOI":"10.1109\/WETICE.2017.36"},{"key":"ref_21","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Hinton","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s11263-016-0911-8","article-title":"Visualizing deep convolutional neural networks using natural pre-images","volume":"120","author":"Mahendran","year":"2016","journal-title":"Int. J. Comput. Vis."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Feder, T., and Motwani, R. (1991, January 5\u20138). Clique partitions, graph compression and speeding-up algorithms. Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, New Orleans, LA, USA.","DOI":"10.1145\/103418.103424"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_25","unstructured":"Rojas, R. (2013). Neural Networks: A Systematic Introduction, Springer Science & Business Media."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Goyal, P., and Ferrara, E. (arXiv, 2017). Graph Embedding Techniques, Applications, and Performance: A Survey, arXiv.","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"ref_27","unstructured":"Goldberg, Y., and Levy, O. (arXiv, 2014). word2vec Explained: Deriving Mikolov et al.\u2019s negative-sampling word-embedding method, arXiv."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"On information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Stat."},{"key":"ref_29","unstructured":"Recht, B., Re, C., Wright, S., and Niu, F. (2011, January 12\u201315). Hogwild: A lock-free approach to parallelizing stochastic gradient descent. Proceedings of the Advances in Neural Information Processing Systems, Granada, Spain."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1109\/TVCG.2010.217","article-title":"Visualization of graph products","volume":"16","author":"Janicke","year":"2010","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., and Zhu, W. (2016, January 13\u201317). Structural deep network embedding. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939753"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Ou, M., Cui, P., Pei, J., Zhang, Z., and Zhu, W. (2016, January 13\u201317). Asymmetric Transitivity Preserving Graph Embedding. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939751"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., and Liu, H. (arXiv, 2017). Attributed Network Embedding for Learning in a Dynamic Environment, arXiv.","DOI":"10.1145\/3132847.3132919"},{"key":"ref_34","unstructured":"Liao, L., He, X., Zhang, H., and Chua, T.S. (arXiv, 2017). Attributed Social Network Embedding, arXiv."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-69311-6_21","article-title":"Ranking of closeness centrality for large-scale social networks","volume":"5059","author":"Okamoto","year":"2008","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Zafarani, R., Abbasi, M.A., and Liu, H. (2014). Social Media Mining: An Introduction, Cambridge University Press.","DOI":"10.1017\/CBO9781139088510"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","article-title":"Centrality and network flow","volume":"27","author":"Borgatti","year":"2005","journal-title":"Soc. Netw."},{"key":"ref_38","unstructured":"Ferrara, E., and Fiumara, G. (arXiv, 2012). Topological features of online social networks, arXiv."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Sun, B., Mitra, P., and Giles, C.L. (2009, January 2\u20136). Learning to rank graphs for online similar graph search. Proceedings of the 18th ACM Conference on Information and Knowledge Management, Hong Kong, China.","DOI":"10.1145\/1645953.1646252"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10994-010-5185-8","article-title":"Learning to rank on graphs","volume":"81","author":"Agarwal","year":"2010","journal-title":"Mach. Learn."},{"key":"ref_41","unstructured":"Yazdani, M., Collobert, R., and Popescu-Belis, A. (2013, January 11). Learning to rank on network data. Proceedings of the Eleventh Workshop on Mining and Learning with Graphs, Chicago, IL, USA."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Herbrich, R., Graepel, T., and Obermayer, K. (2000). Large margin rank boundaries for ordinal regression. Advances in Large Margin Classifiers, MIT Press.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., and Vapnik, V.N. (1992, January 27\u201329). A training algorithm for optimal margin classifiers. Proceedings of the Fifth Annual Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania.","DOI":"10.1145\/130385.130401"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/j.ijforecast.2006.03.001","article-title":"Another look at measures of forecast accuracy","volume":"22","author":"Hyndman","year":"2006","journal-title":"Int. J. Forecast."},{"key":"ref_45","unstructured":"Nair, V., and Hinton, G.E. (2010, January 21\u201324). Rectified linear units improve restricted boltzmann machines. Proceedings of the 27th International Conference on Machine Learning (ICML-10), Haifa, Israel."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Han, J., and Moraga, C. (1995). The influence of the sigmoid function parameters on the speed of backpropagation learning. From Natural to Artificial Neural Computation, Springer.","DOI":"10.1007\/3-540-59497-3_175"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Li, M., Zhang, T., Chen, Y., and Smola, A.J. (2014, January 24\u201327). Efficient mini-batch training for stochastic optimization. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623612"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_49","unstructured":"Thomas, A. (2017, September 25). Community Detection for NetworkX\u2019s Documentation, Available online: https:\/\/bitbucket.org\/taynaud\/python-louvain."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1080\/01621459.1974.10480196","article-title":"EDF statistics for goodness of fit and some comparisons","volume":"69","author":"Stephens","year":"1974","journal-title":"J. Am. Stat. Assoc."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/4\/109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:46:07Z","timestamp":1760208367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/10\/4\/109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":50,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,12]]}},"alternative-id":["a10040109"],"URL":"https:\/\/doi.org\/10.3390\/a10040109","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2017,9,27]]}}}