{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:23:51Z","timestamp":1774121031834,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":55,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186120","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"539-548","source":"Crossref","is-referenced-by-count":207,"title":["VERSE"],"prefix":"10.1145","author":[{"given":"Anton","family":"Tsitsulin","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}]},{"given":"Davide","family":"Mottin","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186120-1","doi-asserted-by":"crossref","unstructured":"Sami Abu-El-Haija, Bryan Perozzi, and Rami Al-Rfou. 2017. Learning Edge Representations via Low-Rank Asymmetric Projections. CIKM (2017).","DOI":"10.1145\/3132847.3132959"},{"key":"key-10.1145\/3178876.3186120-2","unstructured":"Amr Ahmed, Nino Shervashidze, Shravan Narayanamurthy, Vanja Josifovski, and Alexander J Smola. 2013. Distributed large-scale natural graph factorization WWW. ACM, 37--48."},{"key":"key-10.1145\/3178876.3186120-3","doi-asserted-by":"crossref","unstructured":"Leman Akoglu, Mary McGlohon, and Christos Faloutsos. 2010. Oddball: Spotting anomalies in weighted graphs. In PAKDD. 410--421.","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"key-10.1145\/3178876.3186120-4","unstructured":"David Arthur and Sergei Vassilvitskii. 2007. k-means"},{"key":"key-10.1145\/3178876.3186120-5","unstructured":": The advantages of careful seeding. In SIAM. 1027--1035."},{"key":"key-10.1145\/3178876.3186120-6","doi-asserted-by":"crossref","unstructured":"Mikhail Belkin and Partha Niyogi. 2001. Laplacian eigenmaps and spectral techniques for embedding and clustering NIPS. 585--591.","DOI":"10.7551\/mitpress\/1120.003.0080"},{"key":"key-10.1145\/3178876.3186120-7","unstructured":"Yoshua Bengio, Aaron Courville, and Pascal Vincent. 2013. Representation learning: A review and new perspectives. TPAMI (2013), 1798--1828."},{"key":"key-10.1145\/3178876.3186120-8","unstructured":"Yoshua Bengio, Réjean Ducharme, Pascal Vincent, and Christian Jauvin. 2003. A neural probabilistic language model. JMLR (2003), 1137--1155."},{"key":"key-10.1145\/3178876.3186120-9","doi-asserted-by":"crossref","unstructured":"Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment 10 (2008).","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"key-10.1145\/3178876.3186120-10","doi-asserted-by":"crossref","unstructured":"Sergey Brin and Lawrence Page. 1998. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems (1998), 107 -- 117.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"key-10.1145\/3178876.3186120-11","doi-asserted-by":"crossref","unstructured":"Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. GraRep: Learning Graph Representations with Global Structural Information CIKM. 891--900.","DOI":"10.1145\/2806416.2806512"},{"key":"key-10.1145\/3178876.3186120-12","unstructured":"Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2016. Deep Neural Networks for Learning Graph Representations AAAI. 1145--1152."},{"key":"key-10.1145\/3178876.3186120-13","unstructured":"Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A library for large linear classification. JMLR Vol. 9, Aug (2008), 1871--1874."},{"key":"key-10.1145\/3178876.3186120-14","unstructured":"Ian Goodfellow, Yoshua Bengio, and Aaron Courville. 2016. Deep learning. MIT Press."},{"key":"key-10.1145\/3178876.3186120-15","doi-asserted-by":"crossref","unstructured":"Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable Feature Learning for Networks KDD. 855--864.","DOI":"10.1145\/2939672.2939754"},{"key":"key-10.1145\/3178876.3186120-16","unstructured":"Michael Gutmann and Aapo Hyv\"arinen. 2010. Noise-contrastive estimation: A new estimation principle for unnormalized statistical models.. In AISTATS. 297--304."},{"key":"key-10.1145\/3178876.3186120-17","unstructured":"Michael U Gutmann and Aapo Hyv\"arinen. 2012. Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics. JMLR Vol. 13 (2012), 307--361."},{"key":"key-10.1145\/3178876.3186120-18","doi-asserted-by":"crossref","unstructured":"Keith Henderson, Brian Gallagher, Lei Li, Leman Akoglu, Tina Eliassi-Rad, Hanghang Tong, and Christos Faloutsos. 2011. It's who you know: graph mining using recursive structural features KDD. 663--671.","DOI":"10.1145\/2020408.2020512"},{"key":"key-10.1145\/3178876.3186120-19","doi-asserted-by":"crossref","unstructured":"Jiafeng Hu, CK Cheng, Zhipeng Huang, Yixiang Fang, and Siqiang Luo. 2017. On Embedding Uncertain Graphs. In CIKM. ACM.","DOI":"10.1145\/3132847.3132885"},{"key":"key-10.1145\/3178876.3186120-20","doi-asserted-by":"crossref","unstructured":"Xiao Huang, Jundong Li, and Xia Hu. 2017. Label informed attributed network embedding. In WSDM. ACM, 731--739.","DOI":"10.1145\/3018661.3018667"},{"key":"key-10.1145\/3178876.3186120-21","doi-asserted-by":"crossref","unstructured":"Glen Jeh and Jennifer Widom. 2002. SimRank: a measure of structural-context similarity KDD. 538--543.","DOI":"10.1145\/775047.775126"},{"key":"key-10.1145\/3178876.3186120-22","doi-asserted-by":"crossref","unstructured":"Minhao Jiang, Ada Wai-Chee Fu, and Raymond Chi-Wing Wong. 2017. READS: a random walk approach for efficient and accurate dynamic SimRank. VLDB Vol. 10, 9 (2017), 937--948.","DOI":"10.14778\/3099622.3099625"},{"key":"key-10.1145\/3178876.3186120-23","doi-asserted-by":"crossref","unstructured":"Leo Katz. 1953. A new status index derived from sociometric analysis. Psychometrika Vol. 18, 1 (1953), 39--43.","DOI":"10.1007\/BF02289026"},{"key":"key-10.1145\/3178876.3186120-24","unstructured":"Alex Krizhevsky, Ilya Sutskever, and Geoffrey E Hinton. 2012. Imagenet classification with deep convolutional neural networks. 1097--1105."},{"key":"key-10.1145\/3178876.3186120-25","doi-asserted-by":"crossref","unstructured":"Matthieu Labeau and Alexandre Allauzen. 2017. An experimental analysis of Noise-Contrastive Estimation: the noise distribution matters. EACL (2017).","DOI":"10.18653\/v1\/E17-2003"},{"key":"key-10.1145\/3178876.3186120-26","unstructured":"John A. Lee and Michel Verleysen. 2007. Nonlinear Dimensionality Reduction (bibinfoedition1st ed.). Springer Publishing Company, Incorporated."},{"key":"key-10.1145\/3178876.3186120-27","doi-asserted-by":"crossref","unstructured":"Ryan N Lichtenwalter, Jake T Lussier, and Nitesh V Chawla. 2010. New perspectives and methods in link prediction. In KDD. 243--252.","DOI":"10.1145\/1835804.1835837"},{"key":"key-10.1145\/3178876.3186120-28","doi-asserted-by":"crossref","unstructured":"Linyuan Lü and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications Vol. 390, 6 (2011), 1150--1170.","DOI":"10.1016\/j.physa.2010.11.027"},{"key":"key-10.1145\/3178876.3186120-29","unstructured":"Tomas Mikolov, Ilya Sutskever, Kai Chen, Gregory S. Corrado, and Jeffrey Dean. 2013. Distributed Representations of Words and Phrases and their Compositionality NIPS. 3111--3119."},{"key":"key-10.1145\/3178876.3186120-30","unstructured":"Andriy Mnih and Yee Whye Teh. 2012. A fast and simple algorithm for training neural probabilistic language models ICML. 1751--1758."},{"key":"key-10.1145\/3178876.3186120-31","unstructured":"Annamalai Narayanan, Mahinthan Chandramohan, Lihui Chen, Yang Liu, and Santhoshkumar Saminathan. 2016. subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928 (2016)."},{"key":"key-10.1145\/3178876.3186120-32","unstructured":"Mark EJ Newman. 2006. Modularity and community structure in networks. PNAS (2006), 8577--8582."},{"key":"key-10.1145\/3178876.3186120-33","doi-asserted-by":"crossref","unstructured":"Mingdong Ou, Peng Cui, Jian Pei, Ziwei Zhang, and Wenwu Zhu. 2016. Asymmetric transitivity preserving graph embedding KDD. 1105--1114.","DOI":"10.1145\/2939672.2939751"},{"key":"key-10.1145\/3178876.3186120-34","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank citation ranking: bringing order to the web. (1999)."},{"key":"key-10.1145\/3178876.3186120-35","doi-asserted-by":"crossref","unstructured":"Jeffrey Pennington, Richard Socher, and Christopher D Manning. 2014. Glove: Global Vectors for Word Representation.. In EMNLP. 1532--1543.","DOI":"10.3115\/v1\/D14-1162"},{"key":"key-10.1145\/3178876.3186120-36","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi, Leman Akoglu, Patricia Iglesias Sánchez, and Emmanuel Müller. 2014 a. Focused clustering and outlier detection in large attributed graphs KDD. 1346--1355.","DOI":"10.1145\/2623330.2623682"},{"key":"key-10.1145\/3178876.3186120-37","doi-asserted-by":"crossref","unstructured":"Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014 b. DeepWalk: online learning of social representations KDD. 701--710.","DOI":"10.1145\/2623330.2623732"},{"key":"key-10.1145\/3178876.3186120-38","doi-asserted-by":"crossref","unstructured":"Leonardo FR Ribeiro, Pedro HP Saverese, and Daniel R Figueiredo. 2017. struc2vec: Learning node representations from structural identity KDD. ACM, 385--394.","DOI":"10.1145\/3097983.3098061"},{"key":"key-10.1145\/3178876.3186120-39","unstructured":"Sam T Roweis and Lawrence K Saul. 2000. Nonlinear dimensionality reduction by locally linear embedding. science Vol. 290, 5500 (2000), 2323--2326."},{"key":"key-10.1145\/3178876.3186120-40","doi-asserted-by":"crossref","unstructured":"Jiliang Tang and Huan Liu. 2012. Unsupervised Feature Selection for Linked Social Media Data KDD. 904--912.","DOI":"10.1137\/1.9781611972825.11"},{"key":"key-10.1145\/3178876.3186120-41","doi-asserted-by":"crossref","unstructured":"Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. LINE: Large-scale Information Network Embedding. In WWW. 1067--1077.","DOI":"10.1145\/2736277.2741093"},{"key":"key-10.1145\/3178876.3186120-42","doi-asserted-by":"crossref","unstructured":"Lei Tang and Huan Liu. 2009 a. Relational learning via latent social dimensions. In KDD. 817--826.","DOI":"10.1145\/1557019.1557109"},{"key":"key-10.1145\/3178876.3186120-43","doi-asserted-by":"crossref","unstructured":"Lei Tang and Huan Liu. 2009 b. Scalable learning of collective behavior based on sparse social dimensions CIKM. 1107--1116.","DOI":"10.1145\/1645953.1646094"},{"key":"key-10.1145\/3178876.3186120-44","unstructured":"Joshua B Tenenbaum, Vin De Silva, and John C Langford. 2000. A global geometric framework for nonlinear dimensionality reduction. science Vol. 290, 5500 (2000), 2319--2323."},{"key":"key-10.1145\/3178876.3186120-45","doi-asserted-by":"crossref","unstructured":"Grigorios Tsoumakas and Ioannis Katakis. 2006. Multi-label classification: An overview. IJDWM Vol. 3, 3 (2006).","DOI":"10.4018\/jdwm.2007070101"},{"key":"key-10.1145\/3178876.3186120-46","unstructured":"Cunchao Tu, Weicheng Zhang, Zhiyuan Liu, and Maosong Sun. 2016. Max-Margin DeepWalk: Discriminative Learning of Network Representation IJCAI. 3889--3895."},{"key":"key-10.1145\/3178876.3186120-47","unstructured":"L.J.P. van der Maaten and G.E. Hinton. 2008. Visualizing High-Dimensional Data Using t-SNE. Journal of Machine Learning Research Vol. 9 (2008), 2579--2605."},{"key":"key-10.1145\/3178876.3186120-48","doi-asserted-by":"crossref","unstructured":"Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural Deep Network Embedding. In KDD. 1225--1234.","DOI":"10.1145\/2939672.2939753"},{"key":"key-10.1145\/3178876.3186120-49","doi-asserted-by":"crossref","unstructured":"Suhang Wang, Charu Aggarwal, Jiliang Tang, and Huan Liu. 2017. Attributed Signed Network Embedding. CIKM (2017).","DOI":"10.1145\/3132847.3132905"},{"key":"key-10.1145\/3178876.3186120-50","doi-asserted-by":"crossref","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of `small-world' networks. Nature Vol. 393 (1998), 440--442.","DOI":"10.1038\/30918"},{"key":"key-10.1145\/3178876.3186120-51","doi-asserted-by":"crossref","unstructured":"Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-Jiang Zhang, Qiang Yang, and Stephen Lin. 2007. Graph embedding and extensions: A general framework for dimensionality reduction. TPAMI Vol. 29, 1 (2007).","DOI":"10.1109\/TPAMI.2007.250598"},{"key":"key-10.1145\/3178876.3186120-52","doi-asserted-by":"crossref","unstructured":"Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems Vol. 42 (2015), 181--213.","DOI":"10.1007\/s10115-013-0693-z"},{"key":"key-10.1145\/3178876.3186120-53","doi-asserted-by":"crossref","unstructured":"Wayne W Zachary. 1977. An information flow model for conflict and fission in small groups. Journal of anthropological research Vol. 33, 4 (1977), 452--473.","DOI":"10.1086\/jar.33.4.3629752"},{"key":"key-10.1145\/3178876.3186120-54","unstructured":"R. Zafarani and H. Liu. 2009. Social Computing Data Repository at ASU. (2009). deftempurl%http:\/\/socialcomputing.asu.edu tempurl"},{"key":"key-10.1145\/3178876.3186120-55","doi-asserted-by":"crossref","unstructured":"Daokun Zhanga, Jie Yinb, Xingquan Zhuc, and Chengqi Zhanga. 2017. User profile preserving social network embedding. In IJCAI.","DOI":"10.24963\/ijcai.2017\/472"}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186120&ftid=1957445&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:25:46Z","timestamp":1751563546000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186120"}},"subtitle":["Versatile Graph Embeddings from Similarity Measures"],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186120","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}