{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T10:42:02Z","timestamp":1789641722296,"version":"4.0.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,13]],"date-time":"2017-08-13T00:00:00Z","timestamp":1502582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Suomen Akatemia","doi-asserted-by":"publisher","award":["286211"],"award-info":[{"award-number":["286211"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Commission H2020","award":["654024"],"award-info":[{"award-number":["654024"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,13]]},"DOI":"10.1145\/3097983.3098199","type":"proceedings-article","created":{"date-parts":[[2017,8,4]],"date-time":"2017-08-04T18:35:54Z","timestamp":1501871754000},"page":"1017-1025","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Inferring the Strength of Social Ties"],"prefix":"10.1145","author":[{"given":"Polina","family":"Rozenshtein","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"Network construction with subgraph connectivity constraints","author":"Angluin Dana","year":"2013","unstructured":"Dana Angluin , James Aspnes , and Lev Reyzin . 2013 . Network construction with subgraph connectivity constraints . Journal of Combinatorial Optimization ( Jan. 2013). Dana Angluin, James Aspnes, and Lev Reyzin. 2013. Network construction with subgraph connectivity constraints. Journal of Combinatorial Optimization (Jan. 2013).","journal-title":"Journal of Combinatorial Optimization"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2531602.2531642"},{"key":"e_1_3_2_1_3_1","volume-title":"Structural holes: The social structure of competition","author":"Burt Ronald S","unstructured":"Ronald S Burt . 2009. Structural holes: The social structure of competition . Harvard university press . Ronald S Burt. 2009. Structural holes: The social structure of competition. Harvard university press."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2638573"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/2093295"},{"key":"e_1_3_2_1_6_1","volume-title":"The structure of positive interpersonal relations in small groups. Sociological Theories in Progress","author":"Davis J.","year":"1972","unstructured":"J. Davis and S. Leinhardt 1972. The structure of positive interpersonal relations in small groups. Sociological Theories in Progress ( 1972 ), 218--251. J. Davis and S. Leinhardt 1972. The structure of positive interpersonal relations in small groups. Sociological Theories in Progress (1972), 218--251."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629438"},{"key":"e_1_3_2_1_8_1","volume-title":"Networks, crowds, and markets: Reasoning about a highly connected world","author":"Easley David","unstructured":"David Easley and Jon Kleinberg 2010. Networks, crowds, and markets: Reasoning about a highly connected world . Cambridge University Press . David Easley and Jon Kleinberg 2010. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press."},{"key":"e_1_3_2_1_9_1","volume-title":"Uncovering the Formation of Triadic Closure in Social Networks Twenty-Fourth International Joint Conference on Artificial Intelligence. 2062--2068","author":"Fang Zhanpeng","year":"2015","unstructured":"Zhanpeng Fang and Jie Tang 2015 . Uncovering the Formation of Triadic Closure in Social Networks Twenty-Fourth International Joint Conference on Artificial Intelligence. 2062--2068 . Zhanpeng Fang and Jie Tang 2015. Uncovering the Formation of Triadic Closure in Social Networks Twenty-Fourth International Joint Conference on Artificial Intelligence. 2062--2068."},{"key":"e_1_3_2_1_10_1","volume-title":"An analysis of approximations for maximizing submodular set functions-II. Polyhedral combinatorics","author":"Fisher Marshall L","unstructured":"Marshall L Fisher , George L Nemhauser , and Laurence A Wolsey 1978. An analysis of approximations for maximizing submodular set functions-II. Polyhedral combinatorics . Springer , 73--87. Marshall L Fisher, George L Nemhauser, and Laurence A Wolsey 1978. An analysis of approximations for maximizing submodular set functions-II. Polyhedral combinatorics. Springer, 73--87."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145204.2145360"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1518701.1518736"},{"key":"e_1_3_2_1_13_1","volume-title":"The strength of weak ties. American journal of sociology","author":"Granovetter Mark S","year":"1973","unstructured":"Mark S Granovetter . 1973. The strength of weak ties. American journal of sociology Vol. 78 , 6 ( 1973 ), 1360--1380. Mark S Granovetter. 1973. The strength of weak ties. American journal of sociology Vol. 78, 6 (1973), 1360--1380."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0052168"},{"key":"e_1_3_2_1_16_1","volume-title":"Third International AAAI Conference on Weblogs and Social Media","volume":"9","author":"Kahanda Indika","year":"2009","unstructured":"Indika Kahanda and Jennifer Neville 2009 . Using Transactional Information to Predict Link Strength in Online Social Networks . Third International AAAI Conference on Weblogs and Social Media Vol. 9 (2009), 74--81. Indika Kahanda and Jennifer Neville 2009. Using Transactional Information to Predict Link Strength in Online Social Networks. Third International AAAI Conference on Weblogs and Social Media Vol. 9 (2009), 74--81."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116869"},{"key":"e_1_3_2_1_18_1","volume-title":"Predicting positive and negative links in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 641--650","author":"Leskovec Jure","unstructured":"Jure Leskovec , Daniel Huttenlocher , and Jon Kleinberg . 2010. Predicting positive and negative links in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 641--650 . Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Predicting positive and negative links in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 641--650."},{"key":"e_1_3_2_1_19_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_20_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_21_1","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/89\/18001"},{"key":"e_1_3_2_1_22_1","volume-title":"Testing the strength of weak ties theory in small educational social networking websites International Conference on Information Technology Interfaces","author":"Memic Haris","unstructured":"Haris Memic . 2009. Testing the strength of weak ties theory in small educational social networking websites International Conference on Information Technology Interfaces . IEEE , 273--278. Haris Memic. 2009. Testing the strength of weak ties theory in small educational social networking websites International Conference on Information Technology Interfaces. IEEE, 273--278."},{"key":"e_1_3_2_1_23_1","volume-title":"Job search and network composition: Implications of the strength-of-weak-ties hypothesis. American Sociological Review","author":"Montgomery James D","year":"1992","unstructured":"James D Montgomery . 1992. Job search and network composition: Implications of the strength-of-weak-ties hypothesis. American Sociological Review ( 1992 ), 586--596. James D Montgomery. 1992. Job search and network composition: Implications of the strength-of-weak-ties hypothesis. American Sociological Review (1992), 586--596."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1037\/13156-000"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0610245104"},{"key":"e_1_3_2_1_26_1","volume-title":"What is a matroid? Cubo Matem\u00e1tica Educacional","author":"Oxley James","year":"2003","unstructured":"James Oxley . 2003. What is a matroid? Cubo Matem\u00e1tica Educacional Vol. 5 , 3 ( 2003 ), 179--218. James Oxley. 2003. What is a matroid? Cubo Matem\u00e1tica Educacional Vol. 5, 3 (2003), 179--218."},{"key":"e_1_3_2_1_27_1","volume-title":"Using strong triadic closure to characterize ties in social networks Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. ACM, 1466--1475","author":"Sintos Stavros","unstructured":"Stavros Sintos and Panayiotis Tsaparas 2014. Using strong triadic closure to characterize ties in social networks Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. ACM, 1466--1475 . Stavros Sintos and Panayiotis Tsaparas 2014. Using strong triadic closure to characterize ties in social networks Proceedings of the 20th ACM SIGKDD international conference on Knowledge Discovery and Data Mining. ACM, 1466--1475."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Jie Tang Tiancheng Lou and Jon Kleinberg 2012. Inferring social ties across heterogenous networks Proceedings of the fifth ACM international conference on Web Search and Data Mining. ACM 743--752.  Jie Tang Tiancheng Lou and Jon Kleinberg 2012. Inferring social ties across heterogenous networks Proceedings of the fifth ACM international conference on Web Search and Data Mining. ACM 743--752.","DOI":"10.1145\/2124295.2124382"},{"key":"e_1_3_2_1_29_1","volume-title":"Modeling relationship strength in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 981--990","author":"Xiang Rongjing","unstructured":"Rongjing Xiang , Jennifer Neville , and Monica Rogati . 2010. Modeling relationship strength in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 981--990 . Rongjing Xiang, Jennifer Neville, and Monica Rogati. 2010. Modeling relationship strength in online social networks Proceedings of the 19th international conference on World Wide Web. ACM, 981--990."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"}],"event":{"name":"KDD '17: The 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Halifax NS Canada","acronym":"KDD '17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098199","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3097983.3098199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:03Z","timestamp":1750217403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3097983.3098199"}},"subtitle":["A Community-Driven Approach"],"short-title":[],"issued":{"date-parts":[[2017,8,13]]},"references-count":30,"alternative-id":["10.1145\/3097983.3098199","10.1145\/3097983"],"URL":"https:\/\/doi.org\/10.1145\/3097983.3098199","relation":{},"subject":[],"published":{"date-parts":[[2017,8,13]]},"assertion":[{"value":"2017-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}