{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:09Z","timestamp":1763468289352,"version":"3.41.0"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":46,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Defense Advanced Research Projects Agency (DARPA)","award":["W911NF-11-C-0200 and W911NF-12-C-0028"],"award-info":[{"award-number":["W911NF-11-C-0200 and W911NF-12-C-0028"]}]},{"name":"Region II University Transportation Center","award":["49997-33 25"],"award-info":[{"award-number":["49997-33 25"]}]},{"name":"Army Research Laboratory","award":["W911NF- 09-2-0053"],"award-info":[{"award-number":["W911NF- 09-2-0053"]}]},{"name":"National Science Foundation","award":["IIS1017415"],"award-info":[{"award-number":["IIS1017415"]}]},{"name":"National Institutes of Health","award":["R01LM011986"],"award-info":[{"award-number":["R01LM011986"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741132","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"636-646","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Replacing the Irreplaceable"],"prefix":"10.1145","author":[{"given":"Liangyue","family":"Li","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanghang","family":"Tong","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nan","family":"Cao","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kate","family":"Ehrlich","sequence":"additional","affiliation":[{"name":"IBM Research, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Ru","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbou","family":"Buchler","sequence":"additional","affiliation":[{"name":"US Army Research Laboratory, Baltimore, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148181"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3120086.3120127"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_1_5_1","volume-title":"Pacific Symposium on Biocomputing","author":"Borgwardt K. M.","year":"2007","unstructured":"K. M. Borgwardt , H.-P. Kriegel , S. V. N. Vishwanathan , and N. Schraudolph . Graph kernels for disease outcome prediction from protein-protein interaction networks . In Pacific Symposium on Biocomputing , 2007 . K. M. Borgwardt, H.-P. Kriegel, S. V. N. Vishwanathan, and N. Schraudolph. Graph kernels for disease outcome prediction from protein-protein interaction networks. In Pacific Symposium on Biocomputing, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401994"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702446"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208722"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321211.1321221"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460563.1460633"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30217-6_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492628"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.29"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2012.2189529"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144599352836"},{"key":"e_1_3_2_1_16_1","first-page":"216","volume-title":"NIPS","author":"Feragen A.","year":"2013","unstructured":"A. Feragen , N. Kasenburg , J. Petersen , M. de Bruijne , and K. M. Borgwardt . Scalable kernels for graphs with continuous attributes . In NIPS , pages 216 -- 224 , 2013 . A. Feragen, N. Kasenburg, J. Petersen, M. de Bruijne, and K. M. Borgwardt. Scalable kernels for graphs with continuous attributes. In NIPS, pages 216--224, 2013."},{"key":"e_1_3_2_1_17_1","first-page":"129","volume-title":"COLT","author":"Gartner T.","year":"2003","unstructured":"T. Gartner , P. A. Flach , and S. Wrobel . On graph kernels: Hardness results and efficient alternatives . In COLT , pages 129 -- 143 , 2003 . T. Gartner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In COLT, pages 129--143, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000039777.23772.30"},{"key":"e_1_3_2_1_19_1","volume-title":"Matrix computations","author":"Golub G.","year":"1996","unstructured":"G. Golub and C. Van Loan . Matrix computations . 1996 . G. Golub and C. Van Loan. Matrix computations. 1996."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505697"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.30"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/obhd.1999.2875"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.71"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646207"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553443"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242803"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci050039t"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281247"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208685"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.172"},{"key":"e_1_3_2_1_34_1","first-page":"1077","volume-title":"WWW","author":"Rangapuram S. S.","year":"2013","unstructured":"S. S. Rangapuram , T. Buhler , and M. Hein . Towards realistic team formation in social networks based on densest subgraphs . In WWW , pages 1077 -- 1088 , 2013 . S. S. Rangapuram, T. Buhler, and M. Hein. Towards realistic team formation in social networks based on densest subgraphs. In WWW, pages 1077--1088, 2013."},{"key":"e_1_3_2_1_35_1","volume-title":"NIPS","author":"Shervashidze N.","year":"2009","unstructured":"N. Shervashidze and K. M. Borgwardt . Fast subtree kernels on graphs . NIPS , 2009 . N. Shervashidze and K. M. Borgwardt. Fast subtree kernels on graphs. NIPS, 2009."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_3_2_1_37_1","volume-title":"Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research - Proceedings Track, 5:488--495","author":"Shervashidze N.","year":"2009","unstructured":"N. Shervashidze , S.V.N. Vishwanathan , T. Petri , K. Mehlhorn , and K. M. Borgwardt . Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research - Proceedings Track, 5:488--495 , 2009 . N. Shervashidze, S.V.N. Vishwanathan, T. Petri, K. Mehlhorn, and K. M. Borgwardt. Efficient graphlet kernels for large graph comparison. Journal of Machine Learning Research - Proceedings Track, 5:488--495, 2009."},{"key":"e_1_3_2_1_38_1","volume-title":"The Sciences of the Artificial","author":"Simon H. A.","year":"1996","unstructured":"H. A. Simon . The Sciences of the Artificial ( 3 rd Ed.). MIT Press , Cambridge, MA, USA , 1996 . H. A. Simon. The Sciences of the Artificial (3rd Ed.). MIT Press, Cambridge, MA, USA, 1996.","edition":"3"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.68"},{"key":"e_1_3_2_1_40_1","first-page":"1449","volume-title":"NIPS","author":"Vishwanathan S. V. N.","year":"2006","unstructured":"S. V. N. Vishwanathan , K. M. Borgwardt , and N. N. Schraudolph . Fast computation of graph kernels . In NIPS , pages 1449 -- 1456 , 2006 . S. V. N. Vishwanathan, K. M. Borgwardt, and N. N. Schraudolph. Fast computation of graph kernels. In NIPS, pages 1449--1456, 2006."},{"key":"e_1_3_2_1_41_1","first-page":"1201","article-title":"Graph kernels","volume":"99","author":"Vishwanathan S. V. N.","year":"2010","unstructured":"S. V. N. Vishwanathan , N. N. Schraudolph , R. Kondor , and K. M. Borgwardt . Graph kernels . The Journal of Machine Learning Research , 99 : 1201 -- 1242 , 2010 . S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt. Graph kernels. The Journal of Machine Learning Research, 99:1201--1242, 2010.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020480"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433404"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979372"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242603"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398493"}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Florence Italy","acronym":"WWW '15"},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741132","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:29Z","timestamp":1750227149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741132"}},"subtitle":["Fast Algorithms for Team Member Recommendation"],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":46,"alternative-id":["10.1145\/2736277.2741132","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741132","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}