{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:09:58Z","timestamp":1763705398245,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":32,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1145\/3041021.3055139","type":"proceedings-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T18:39:25Z","timestamp":1515695965000},"page":"983-992","source":"Crossref","is-referenced-by-count":37,"title":["Detecting Strong Ties Using Network Motifs"],"prefix":"10.1145","author":[{"given":"Rahmtin","family":"Rotabi","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishna","family":"Kamath","sequence":"additional","affiliation":[{"name":"Twitter Inc., San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aneesh","family":"Sharma","sequence":"additional","affiliation":[{"name":"Twitter Inc., San Francisco, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3041021.3055139-1","doi-asserted-by":"crossref","unstructured":"L. Backstrom and J. M. Kleinberg. Romantic partnerships and the dispersion of social ties: A network analysis of relationship status on facebook. In ACM CSCW, 2014.","DOI":"10.1145\/2531602.2531642"},{"key":"key-10.1145\/3041021.3055139-2","doi-asserted-by":"crossref","unstructured":"J. Bobadilla, F. Ortega, A. Hernando, and J. Bernal. A collaborative filtering approach to mitigate the new user cold start problem. Knowledge-Based Systems, 26:225--238, 2012.","DOI":"10.1016\/j.knosys.2011.07.021"},{"key":"key-10.1145\/3041021.3055139-3","doi-asserted-by":"crossref","unstructured":"C. Borgs, J. T. Chayes, L. Lovasz, V. Sos, B. Szegedy, and K. Vesztergombi. Counting graph homomorphisms. In M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas, and P. Valtr, editors, Topics in Discrete Mathematics. Springer, 2006.","DOI":"10.1007\/3-540-33700-8_18"},{"key":"key-10.1145\/3041021.3055139-4","doi-asserted-by":"crossref","unstructured":"A. Condon and R. M. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 2001.","DOI":"10.1002\/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"},{"key":"key-10.1145\/3041021.3055139-5","doi-asserted-by":"crossref","unstructured":"J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Communications of the ACM, 51(1):107--113, 2008.","DOI":"10.1145\/1327452.1327492"},{"key":"key-10.1145\/3041021.3055139-6","doi-asserted-by":"crossref","unstructured":"N. Eagle, A. S. Pentland, and D. Lazer. Inferring friendship network structure by using mobile phone data. Proc. Natl. Acad. Sci. USA, 106(36), 2009.","DOI":"10.1073\/pnas.0900282106"},{"key":"key-10.1145\/3041021.3055139-7","doi-asserted-by":"crossref","unstructured":"K. Faust. A puzzle concerning triads in social networks: Graph constraints and the triad census. Social Networks, 32(3), 2010.","DOI":"10.1016\/j.socnet.2010.03.004"},{"key":"key-10.1145\/3041021.3055139-8","doi-asserted-by":"crossref","unstructured":"P. Flajolet, &#201;. Fusy, O. Gandouet, and F. Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. DMTCS Proceedings, 2008.","DOI":"10.46298\/dmtcs.3545"},{"key":"key-10.1145\/3041021.3055139-9","doi-asserted-by":"crossref","unstructured":"E. Gilbert. Predicting tie strength in a new medium. In CSCW. ACM, 2012.","DOI":"10.1145\/2145204.2145360"},{"key":"key-10.1145\/3041021.3055139-10","doi-asserted-by":"crossref","unstructured":"E. Gilbert and K. Karahalios. Predicting tie strength with social media. In SIGCHI. ACM, 2009.","DOI":"10.1145\/1518701.1518736"},{"key":"key-10.1145\/3041021.3055139-11","doi-asserted-by":"crossref","unstructured":"M. Granovetter. The strength of weak ties. American Journal of Sociology, 78, 1973.","DOI":"10.1086\/225469"},{"key":"key-10.1145\/3041021.3055139-12","unstructured":"T. Joachims. Transductive learning via spectral graph partitioning. In ICML, 2003."},{"key":"key-10.1145\/3041021.3055139-13","doi-asserted-by":"crossref","unstructured":"J. J. Jones, J. E. Settle, R. M. Bond, C. J. Fariss, C. Marlow, and J. H. Fowler. Inferring tie strength from online directed behavior. PLoS ONE, Jan. 2013.","DOI":"10.1371\/journal.pone.0052168"},{"key":"key-10.1145\/3041021.3055139-14","unstructured":"M. Kim and J. Leskovec. Modeling social networks with node attributes using the multiplicative attribute graph model. In UAI, 2011."},{"key":"key-10.1145\/3041021.3055139-15","doi-asserted-by":"crossref","unstructured":"M. Kim and J. Leskovec. The network completion problem: Inferring missing nodes and edges in networks. In SIAM, 2011.","DOI":"10.1137\/1.9781611972818.5"},{"key":"key-10.1145\/3041021.3055139-16","doi-asserted-by":"crossref","unstructured":"M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, 2001.","DOI":"10.1109\/ICDM.2001.989534"},{"key":"key-10.1145\/3041021.3055139-17","doi-asserted-by":"crossref","unstructured":"L. Liu, J. Tang, J. Han, M. Jiang, and S. Yang. Mining topic-level influence in heterogeneous networks. In CIKM, 2010.","DOI":"10.1145\/1871437.1871467"},{"key":"key-10.1145\/3041021.3055139-18","doi-asserted-by":"crossref","unstructured":"P. V. Marsden and K. E. Campbell. Measuring tie stength. Social Forces, 63(2), Dec. 1984.","DOI":"10.1093\/sf\/63.2.482"},{"key":"key-10.1145\/3041021.3055139-19","doi-asserted-by":"crossref","unstructured":"F. McSherry. Spectral partitioning of random graphs. In FOCS, 2001.","DOI":"10.1109\/SFCS.2001.959929"},{"key":"key-10.1145\/3041021.3055139-20","doi-asserted-by":"crossref","unstructured":"R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298(5594), Oct. 2002.","DOI":"10.1126\/science.298.5594.824"},{"key":"key-10.1145\/3041021.3055139-21","doi-asserted-by":"crossref","unstructured":"F. K. C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborov&#225;, and P. Zhang. Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. USA, 110(52), 2013.","DOI":"10.1073\/pnas.1312486110"},{"key":"key-10.1145\/3041021.3055139-22","unstructured":"E. Mossel, J. Neeman, and A. Sly. Belief propagation, robust reconstruction, and optimal recovery of block models. COLT, 2014."},{"key":"key-10.1145\/3041021.3055139-23","doi-asserted-by":"crossref","unstructured":"A. I. Schein, A. Popescul, L. H. Ungar, and D. M. Pennock. Methods and metrics for cold-start recommendations. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, pages 253--260. ACM, 2002.","DOI":"10.1145\/564376.564421"},{"key":"key-10.1145\/3041021.3055139-24","doi-asserted-by":"crossref","unstructured":"S. Sedhain, S. Sanner, D. Braziunas, L. Xie, and J. Christensen. Social collaborative filtering for cold-start recommendations. In Proceedings of the 8th ACM Conference on Recommender systems, pages 345--348. ACM, 2014.","DOI":"10.1145\/2645710.2645772"},{"key":"key-10.1145\/3041021.3055139-25","doi-asserted-by":"crossref","unstructured":"C. Seshadhri, A. Pinar, and T. G. Kolda. Triadic measures on graphs: The power of wedge sampling. In SIAM International Conference on Data Mining (SDM), pages 10--18. SIAM, 2013.","DOI":"10.1137\/1.9781611972832.2"},{"key":"key-10.1145\/3041021.3055139-26","doi-asserted-by":"crossref","unstructured":"S. Sintos and P. Tsaparas. Using strong triadic closure to characterize ties in social networks. In SIGKDD, 2014.","DOI":"10.1145\/2623330.2623664"},{"key":"key-10.1145\/3041021.3055139-27","doi-asserted-by":"crossref","unstructured":"Y. Sun, R. Barber, M. Gupta, C. C. Aggarwal, and J. Han. Co-author relationship prediction in heterogeneous bibliographic networks. In International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2011, Kaohsiung, Taiwan, 25-27 July 2011, pages 121--128, 2011.","DOI":"10.1109\/ASONAM.2011.112"},{"key":"key-10.1145\/3041021.3055139-28","doi-asserted-by":"crossref","unstructured":"J. Tang, T. Lou, and J. M. Kleinberg. Inferring social ties across heterogenous networks. In WSDM, 2012.","DOI":"10.1145\/2124295.2124382"},{"key":"key-10.1145\/3041021.3055139-29","doi-asserted-by":"crossref","unstructured":"J. Ugander, L. Backstrom, and J. Kleinberg. Subgraph frequencies: Mapping the empirical and extremal geography of large graph collections. In WWW, 2013.","DOI":"10.1145\/2488388.2488502"},{"key":"key-10.1145\/3041021.3055139-30","doi-asserted-by":"crossref","unstructured":"C. Wang, J. Han, Y. Jia, J. Tang, D. Zhang, Y. Yu, and J. Guo. Mining advisor-advisee relationships from research publication networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25--28, 2010, pages 203--212, 2010.","DOI":"10.1145\/1835804.1835833"},{"key":"key-10.1145\/3041021.3055139-31","unstructured":"X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, 2002."},{"key":"key-10.1145\/3041021.3055139-32","unstructured":"X. Zhu and Z. Ghahramani. Learning from labeled and unlabeled data with label propagation. Technical report, Carnegie Mellon University, 2002."}],"event":{"number":"26","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"acronym":"WWW '17 Companion","name":"the 26th International Conference","start":{"date-parts":[[2017,4,3]]},"location":"Perth, Australia","end":{"date-parts":[[2017,4,7]]}},"container-title":["Proceedings of the 26th International Conference on World Wide Web Companion - WWW '17 Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041021.3055139","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3055139&ftid=1865358&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:31Z","timestamp":1750215811000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3041021.3055139"}},"subtitle":[],"proceedings-subject":"World Wide Web Companion","short-title":[],"issued":{"date-parts":[[2017]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1145\/3041021.3055139","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}