{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:49:02Z","timestamp":1762865342735,"version":"3.41.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>\n            Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity between nodes in networks. We propose a new way of measuring and extracting proximity in networks called \u201ccycle-free effective conductance\u201d (CFEC). Importantly, the measured proximity is accompanied with a\n            <jats:italic>proximity subgraph<\/jats:italic>\n            which allows assessing and understanding measured values. Our proximity calculation can handle more than two endpoints, directed edges, is statistically well behaved, and produces an effectiveness score for the computed subgraphs. We provide an efficient algorithm to measure and extract proximity. Also, we report experimental results and show examples for four large network datasets: a telecommunications calling graph, the IMDB actors graph, an academic coauthorship network, and a movie recommendation system.\n          <\/jats:p>","DOI":"10.1145\/1297332.1297336","type":"journal-article","created":{"date-parts":[[2007,12,7]],"date-time":"2007-12-07T19:19:01Z","timestamp":1197055141000},"page":"12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Measuring and extracting proximity graphs in networks"],"prefix":"10.1145","volume":"1","author":[{"given":"Yehuda","family":"Koren","sequence":"first","affiliation":[{"name":"AT&amp;T Labs -- Research, Florham Park, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C.","family":"North","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs -- Research, Florham Park, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Volinsky","sequence":"additional","affiliation":[{"name":"AT&amp;T Labs -- Research, Florham Park, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281206"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090193.1090195"},{"volume-title":"Modern Graph Theory","author":"Bollobas B.","key":"e_1_2_1_4_1","unstructured":"Bollobas , B. 1998. Modern Graph Theory . Springer . Bollobas, B. 1998. Modern Graph Theory. Springer."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/264645.264657"},{"key":"e_1_2_1_7_1","unstructured":"Cormen T. H. Leiserson C. L. and Rivest R. L. 1990. Introduction to Algorithms. McGraw-Hill\/MIT Press.   Cormen T. H. Leiserson C. L. and Rivest R. L. 1990. Introduction to Algorithms. McGraw-Hill\/MIT Press."},{"key":"e_1_2_1_8_1","unstructured":"dblp. 1998. DBLP computer science bibliography. dblp.uni-trier.de.  dblp. 1998. DBLP computer science bibliography. dblp.uni-trier.de."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Doyle P. G. and Snell J. L. 1984. Random Walks and Electrical Networks. Mathematical Association of America. http:\/\/arxiv.org\/abs\/math.PR\/0001057.  Doyle P. G. and Snell J. L. 1984. Random Walks and Electrical Networks. Mathematical Association of America. http:\/\/arxiv.org\/abs\/math.PR\/0001057.","DOI":"10.5948\/UPO9781614440222"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014068"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_2_1_12_1","unstructured":"Garey M. R. and Johnson D. S. 1979. Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman New York.   Garey M. R. and Johnson D. S. 1979. Computers and Intractability A Guide to the Theory of NP-Completeness. W.H. Freeman New York."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276627.276652"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199909)34:2<88::AID-NET2>3.0.CO;2-1"},{"key":"e_1_2_1_15_1","unstructured":"imdb. 2007. Internet Movie Database. www.imdb.com.  imdb. 2007. Internet Movie Database. www.imdb.com."},{"volume-title":"Proceedings of the 5th Workshop on Algorithm Engineering and Experimentation (ALENEX). SIAM, 26--36","author":"John Hershberger J. M. M.","key":"e_1_2_1_16_1","unstructured":"John Hershberger , J. M. M. and Suri , S . 2003. Finding the k shortest simple paths: A new algorithm and its implementation . In Proceedings of the 5th Workshop on Algorithm Engineering and Experimentation (ALENEX). SIAM, 26--36 . John Hershberger, J. M. M. and Suri, S. 2003. Finding the k shortest simple paths: A new algorithm and its implementation. In Proceedings of the 5th Workshop on Algorithm Engineering and Experimentation (ALENEX). SIAM, 26--36."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150432"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956972"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2005-6-13-r114"},{"key":"e_1_2_1_22_1","unstructured":"netflix. 2007. Netflix prize. www.netflixprize.com.  netflix. 2007. Netflix prize. www.netflixprize.com."},{"volume-title":"Proceedings of the Workshop on Learning Statistical Models from Relational Data (IJCAI).","author":"Popescul A.","key":"e_1_2_1_23_1","unstructured":"Popescul , A. and Ungar , L. H . 2003. Statistical relational learning for link prediction . In Proceedings of the Workshop on Learning Statistical Models from Relational Data (IJCAI). Popescul, A. and Ungar, L. H. 2003. Statistical relational learning for link prediction. In Proceedings of the Workshop on Learning Statistical Models from Relational Data (IJCAI)."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273596"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150448"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297332.1297336","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1297332.1297336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:02Z","timestamp":1750259642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1297332.1297336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1145\/1297332.1297336"],"URL":"https:\/\/doi.org\/10.1145\/1297332.1297336","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2007,12]]},"assertion":[{"value":"2007-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}