{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:07Z","timestamp":1750221127945,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T00:00:00Z","timestamp":1548806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100011051","name":"Council on grants of the President of the Russian Federation","doi-asserted-by":"publisher","award":["MK-527.2017.1"],"award-info":[{"award-number":["MK-527.2017.1"]}],"id":[{"id":"10.13039\/501100011051","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,30]]},"DOI":"10.1145\/3289600.3290961","type":"proceedings-article","created":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T12:33:01Z","timestamp":1552307581000},"page":"708-716","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Spring-Electrical Models For Link Prediction"],"prefix":"10.1145","author":[{"given":"Yana","family":"Kashinskaya","sequence":"first","affiliation":[{"name":"Yandex School of Data Analysis, Moscow, Russian Fed."}]},{"given":"Egor","family":"Samosvat","sequence":"additional","affiliation":[{"name":"Yandex, Moscow, Russian Fed."}]},{"given":"Akmal","family":"Artikov","sequence":"additional","affiliation":[{"name":"Yandex, Moscow, Russian Fed."}]}],"member":"320","published-online":{"date-parts":[[2019,1,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2009.54"},{"key":"e_1_3_2_1_2_1","volume-title":"Friends and neighbors on the web. Social networks","author":"Adamic Lada A","year":"2003","unstructured":"Lada A Adamic and Eytan Adar . 2003. Friends and neighbors on the web. Social networks , Vol. 25 , 3 ( 2003 ), 211--230. Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks, Vol. 25, 3 (2003), 211--230."},{"key":"e_1_3_2_1_3_1","volume-title":"Emergence of scaling in random networks. science","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science , Vol. 286 , 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science, Vol. 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_1_4_1","volume-title":"A hierarchical O (N log N) force-calculation algorithm. nature","author":"Barnes Josh","year":"1986","unstructured":"Josh Barnes and Piet Hut . 1986. A hierarchical O (N log N) force-calculation algorithm. nature , Vol. 324 , 6096 ( 1986 ), 446--449. Josh Barnes and Piet Hut. 1986. A hierarchical O (N log N) force-calculation algorithm. nature, Vol. 324, 6096 (1986), 446--449."},{"key":"e_1_3_2_1_5_1","volume-title":"Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE transactions on fundamentals of electronics, communications and computer sciences","author":"Cichocki Andrzej","year":"2009","unstructured":"Andrzej Cichocki and PHAN Anh-Huy . 2009. Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE transactions on fundamentals of electronics, communications and computer sciences , Vol. 92 , 3 ( 2009 ), 708--721. Andrzej Cichocki and PHAN Anh-Huy. 2009. Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE transactions on fundamentals of electronics, communications and computer sciences, Vol. 92, 3 (2009), 708--721."},{"key":"e_1_3_2_1_6_1","volume-title":"The 2011 International Joint Conference on. IEEE, 1237--1244","author":"Cukierski William","year":"2011","unstructured":"William Cukierski , Benjamin Hamner , and Bo Yang . 2011 . Graph-based features for supervised link prediction. In Neural Networks (IJCNN) , The 2011 International Joint Conference on. IEEE, 1237--1244 . William Cukierski, Benjamin Hamner, and Bo Yang. 2011. Graph-based features for supervised link prediction. In Neural Networks (IJCNN), The 2011 International Joint Conference on. IEEE, 1237--1244."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921636"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"},{"key":"e_1_3_2_1_9_1","volume-title":"Graph Embedding Techniques, Applications, and Performance: A Survey. arXiv preprint arXiv:1705.02801","author":"Goyal Palash","year":"2017","unstructured":"Palash Goyal and Emilio Ferrara . 2017. Graph Embedding Techniques, Applications, and Performance: A Survey. arXiv preprint arXiv:1705.02801 ( 2017 ). Palash Goyal and Emilio Ferrara. 2017. Graph Embedding Techniques, Applications, and Performance: A Survey. arXiv preprint arXiv:1705.02801 (2017)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_2_1_12_1","first-page":"37","article-title":"Efficient, high-quality force-directed graph drawing","volume":"10","author":"Hu Yifan","year":"2005","unstructured":"Yifan Hu . 2005 . Efficient, high-quality force-directed graph drawing . Mathematica Journal , Vol. 10 , 1 (2005), 37 -- 71 . Yifan Hu. 2005. Efficient, high-quality force-directed graph drawing. Mathematica Journal, Vol. 10, 1 (2005), 37--71.","journal-title":"Mathematica Journal"},{"key":"e_1_3_2_1_13_1","volume-title":"The singular value decomposition: Its computation and some applications","author":"Klema Virginia","year":"1980","unstructured":"Virginia Klema and Alan Laub . 1980. The singular value decomposition: Its computation and some applications . IEEE transactions on automatic control, Vol. 25 , 2 ( 1980 ), 164--176. Virginia Klema and Alan Laub. 1980. The singular value decomposition: Its computation and some applications. IEEE transactions on automatic control, Vol. 25, 2 (1980), 164--176."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_16_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data . (June 2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data . (June 2014)."},{"key":"e_1_3_2_1_17_1","volume-title":"The link-prediction problem for social networks. journal of the Association for Information Science and Technology","author":"Liben-Nowell David","year":"2007","unstructured":"David Liben-Nowell and Jon Kleinberg . 2007. The link-prediction problem for social networks. journal of the Association for Information Science and Technology , Vol. 58 , 7 ( 2007 ), 1019--1031. David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. journal of the Association for Information Science and Technology, Vol. 58, 7 (2007), 1019--1031."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"e_1_3_2_1_19_1","volume-title":"Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications","author":"L\u00fc Linyuan","year":"2011","unstructured":"Linyuan L\u00fc and Tao Zhou . 2011. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications , Vol. 390 , 6 ( 2011 ), 1150--1170. Linyuan L\u00fc and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and its Applications, Vol. 390, 6 (2011), 1150--1170."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.148"},{"volume-title":"Joint european conference on machine learning and knowledge discovery in databases","author":"Menon Aditya Krishna","key":"e_1_3_2_1_21_1","unstructured":"Aditya Krishna Menon and Charles Elkan . 2011. Link prediction via matrix factorization . In Joint european conference on machine learning and knowledge discovery in databases . Springer , 437--452. Aditya Krishna Menon and Charles Elkan. 2011. Link prediction via matrix factorization. In Joint european conference on machine learning and knowledge discovery in databases. Springer, 437--452."},{"key":"e_1_3_2_1_22_1","volume-title":"Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg Corrado , and Jeffrey Dean . 2013a. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 ( 2013 ). Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013a. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)."},{"key":"e_1_3_2_1_23_1","unstructured":"Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013b. Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems. 3111--3119.   Tomas Mikolov Ilya Sutskever Kai Chen Greg S Corrado and Jeff Dean. 2013b. Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems. 3111--3119."},{"key":"e_1_3_2_1_24_1","unstructured":"Kurt Miller Michael I Jordan and Thomas L Griffiths. 2009. Nonparametric latent feature models for link prediction. In Advances in neural information processing systems. 1276--1284.   Kurt Miller Michael I Jordan and Thomas L Griffiths. 2009. Nonparametric latent feature models for link prediction. In Advances in neural information processing systems. 1276--1284."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.026102"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/336992.337035"},{"key":"e_1_3_2_1_28_1","volume-title":"Structural link prediction based on ant colony approach in social networks. Physica A: Statistical Mechanics and its Applications","author":"Sherkat Ehsan","year":"2015","unstructured":"Ehsan Sherkat , Maseud Rahgozar , and Masoud Asadpour . 2015. Structural link prediction based on ant colony approach in social networks. Physica A: Statistical Mechanics and its Applications , Vol. 419 ( 2015 ), 80--94. Ehsan Sherkat, Maseud Rahgozar, and Masoud Asadpour. 2015. Structural link prediction based on ant colony approach in social networks. Physica A: Statistical Mechanics and its Applications, Vol. 419 (2015), 80--94."},{"key":"e_1_3_2_1_29_1","first-page":"265","article-title":"Co-citation in the scientific literature: A new measure of the relationship between two documents","volume":"24","author":"Small Henry","year":"1973","unstructured":"Henry Small . 1973 . Co-citation in the scientific literature: A new measure of the relationship between two documents . Journal of the Association for Information Science and Technology , Vol. 24 , 4 (1973), 265 -- 269 . Henry Small. 1973. Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the Association for Information Science and Technology, Vol. 24, 4 (1973), 265--269.","journal-title":"Journal of the Association for Information Science and Technology"},{"key":"e_1_3_2_1_30_1","unstructured":"Charles F Van Loan. 1996. Matrix computations (Johns Hopkins studies in mathematical sciences). (1996).  Charles F Van Loan. 1996. Matrix computations (Johns Hopkins studies in mathematical sciences). (1996)."},{"key":"e_1_3_2_1_31_1","volume-title":"International Symposium on Graph Drawing. Springer, 171--182","author":"Walshaw Chris","year":"2000","unstructured":"Chris Walshaw . 2000 . A multilevel algorithm for force-directed graph drawing . In International Symposium on Graph Drawing. Springer, 171--182 . Chris Walshaw. 2000. A multilevel algorithm for force-directed graph drawing. In International Symposium on Graph Drawing. Springer, 171--182."}],"event":{"name":"WSDM '19: The Twelfth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Melbourne VIC Australia","acronym":"WSDM '19"},"container-title":["Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289600.3290961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289600.3290961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:20Z","timestamp":1750208540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289600.3290961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,30]]},"references-count":31,"alternative-id":["10.1145\/3289600.3290961","10.1145\/3289600"],"URL":"https:\/\/doi.org\/10.1145\/3289600.3290961","relation":{},"subject":[],"published":{"date-parts":[[2019,1,30]]},"assertion":[{"value":"2019-01-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}