{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:07:10Z","timestamp":1763467630597,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"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":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014064","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"79-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":126,"title":["Fully automatic cross-associations"],"prefix":"10.1145","author":[{"given":"Deepayan","family":"Chakrabarti","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Spiros","family":"Papadimitriou","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Dharmendra S.","family":"Modha","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"727","volume-title":"17th ICML","author":"Pelleg D.","year":"2000","unstructured":"D. Pelleg and A. Moore , \" X-means: Extending K-means with efficient estimation of the number of clusters,\" in Proc . 17th ICML , pp. 727 -- 734 , 2000 .]] D. Pelleg and A. Moore, \"X-means: Extending K-means with efficient estimation of the number of clusters,\" in Proc. 17th ICML, pp. 727--734, 2000.]]"},{"key":"e_1_3_2_1_2_1","volume-title":"17th NIPS","author":"Hamerly G.","year":"2003","unstructured":"G. Hamerly and C. Elkan , \" Learning the k in k-means,\" in Proc . 17th NIPS , 2003 .]] G. Hamerly and C. Elkan, \"Learning the k in k-means,\" in Proc. 17th NIPS, 2003.]]"},{"key":"e_1_3_2_1_3_1","first-page":"31","volume-title":"1st TSDM","author":"Zhang B.","year":"2000","unstructured":"B. Zhang , M. Hsu , and U. Dayal , \" K-harmonic means---a spatial clustering algorithm with boosting,\" in Proc . 1st TSDM , pp. 31 -- 45 , 2000 .]] B. Zhang, M. Hsu, and U. Dayal, \"K-harmonic means---a spatial clustering algorithm with boosting,\" in Proc. 1st TSDM, pp. 31--45, 2000.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007612920971"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233324"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"e_1_3_2_1_8_1","first-page":"58","volume-title":"4th KDD","author":"Hinneburg A.","year":"1998","unstructured":"A. Hinneburg and D. A. Keim , \" An efficient approach to clustering in large multimedia databases with noise,\" in Proc . 4th KDD , pp. 58 -- 65 , 1998 .]] A. Hinneburg and D. A. Keim, \"An efficient approach to clustering in large multimedia databases with noise,\" in Proc. 4th KDD, pp. 58--65, 1998.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Morgan Kaufmann","author":"Han J.","year":"2000","unstructured":"J. Han and M. Kamber , Data Mining: Concepts and Techniques . Morgan Kaufmann , 2000 .]] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956764"},{"key":"e_1_3_2_1_11_1","volume-title":"IEEE ISIT","author":"Madiman M. M.","year":"2004","unstructured":"M. M. Madiman , M. Harrison , and I. Kontoyiannis , \" A minimum description length proposal for lossy data compression,\" in Proc . IEEE ISIT , 2004 .]] M. M. Madiman, M. Harrison, and I. Kontoyiannis, \"A minimum description length proposal for lossy data compression,\" in Proc. IEEE ISIT, 2004.]]"},{"key":"e_1_3_2_1_12_1","first-page":"152","volume-title":"17th UAI","author":"Friedman N.","year":"2001","unstructured":"N. Friedman , O. Mosenzon , N. Slonim , and N. Tishby , \" Multivariate information bottleneck,\" in Proc . 17th UAI , pp. 152 -- 161 , 2001 .]] N. Friedman, O. Mosenzon, N. Slonim, and N. Tishby, \"Multivariate information bottleneck,\" in Proc. 17th UAI, pp. 152--161, 2001.]]"},{"key":"e_1_3_2_1_13_1","first-page":"487","volume-title":"20th VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant , \" Fast algorithms for mining association rules in large databases,\" in Proc . 20th VLDB , pp. 487 -- 499 , 1994 .]] R. Agrawal and R. Srikant, \"Fast algorithms for mining association rules in large databases,\" in Proc. 20th VLDB, pp. 487--499, 1994.]]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775104"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/291128.291131"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_3_2_1_20_1","first-page":"1","volume-title":"SC98","author":"Karypis G.","year":"1998","unstructured":"G. Karypis and V. Kumar , \" Multilevel algorithms for multi-constraint graph partitioning,\" in Proc . SC98 , pp. 1 -- 13 , 1998 .]] G. Karypis and V. Kumar, \"Multilevel algorithms for multi-constraint graph partitioning,\" in Proc. SC98, pp. 1--13, 1998.]]"},{"key":"e_1_3_2_1_21_1","first-page":"849","volume-title":"NIPS","author":"Ng A. Y.","year":"2001","unstructured":"A. Y. Ng , M. I. Jordan , and Y. Weiss , \" On spectral clustering: Analysis and an algorithm,\" in Proc . NIPS , pp. 849 -- 856 , 2001 .]] A. Y. Ng, M. I. Jordan, and Y. Weiss, \"On spectral clustering: Analysis and an algorithm,\" in Proc. NIPS, pp. 849--856, 2001.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"16th COLT","author":"Mishra N.","year":"2003","unstructured":"N. Mishra , D. Ron , and R. Swaminathan , \" On finding large conjunctive clusters,\" in Proc . 16th COLT , 2003 .]] N. Mishra, D. Ron, and R. Swaminathan, \"On finding large conjunctive clusters,\" in Proc. 16th COLT, 2003.]]"},{"key":"e_1_3_2_1_23_1","first-page":"302","volume-title":"2nd WISE","author":"Reddy P. K.","year":"2001","unstructured":"P. K. Reddy and M. Kitsuregawa , \" An approach to relate the web communities through bipartite graphs,\" in Proc . 2nd WISE , pp. 302 -- 310 , 2001 .]] P. K. Reddy and M. Kitsuregawa, \"An approach to relate the web communities through bipartite graphs,\" in Proc. 2nd WISE, pp. 302--310, 2001.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956942"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0198"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.232.0149"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/214762.214771"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346150"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","DOI":"10.1515\/9780691188331","volume-title":"Small Worlds: The Dynamics of Networks between Order and Randomness","author":"Watts D. J.","year":"1999","unstructured":"D. J. Watts , Small Worlds: The Dynamics of Networks between Order and Randomness . Princeton Univ. Press , 1999 .]] D. J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.]]"},{"key":"e_1_3_2_1_31_1","first-page":"351","volume-title":"2nd ISWC","author":"Richardson M.","year":"2003","unstructured":"M. Richardson , R. Agrawal , and P. Domingos , \" Trust management for the semantic web,\" in Proc . 2nd ISWC , pp. 351 -- 368 , 2003 .]] M. Richardson, R. Agrawal, and P. Domingos, \"Trust management for the semantic web,\" in Proc. 2nd ISWC, pp. 351--368, 2003.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.933515"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Seattle WA USA","acronym":"KDD04"},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014064","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:30Z","timestamp":1750264290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":32,"alternative-id":["10.1145\/1014052.1014064","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014064","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}