{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:44Z","timestamp":1750307924810,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,11]],"date-time":"2007-06-11T00:00:00Z","timestamp":1181520000000},"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":[[2007,6,11]]},"DOI":"10.1145\/1247480.1247530","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"437-448","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Leveraging aggregate constraints for deduplication"],"prefix":"10.1145","author":[{"given":"Surajit","family":"Chaudhuri","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Anish","family":"Das Sarma","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Venkatesh","family":"Ganti","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]},{"given":"Raghav","family":"Kaushik","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"The K-Means Clustering Algorithm. http:\/\/mathworld.wolfram.com\/K-MeansClusteringAlgorithm.html.  The K-Means Clustering Algorithm. http:\/\/mathworld.wolfram.com\/K-MeansClusteringAlgorithm.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Association for computing machinery. http:\/\/www.acm.org.  Association for computing machinery. http:\/\/www.acm.org."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287420"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms","author":"Aslam J. A.","year":"1999","unstructured":"J. A. Aslam , K. Pelehov , and D. Rus . A practical clustering algorithm for static and dynamic information organization . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms , 1999 . J. A. Aslam, K. Pelehov, and D. Rus. A practical clustering algorithm for static and dynamic information organization. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 1999."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_6_1","volume-title":"Data Engineering Bulletin","author":"Bhattacharya I.","year":"2006","unstructured":"I. Bhattacharya and L. Getoor . Collective Entity Resolution In Relational Data . In Data Engineering Bulletin , 2006 . I. Bhattacharya and L. Getoor. Collective Entity Resolution In Relational Data. In Data Engineering Bulletin, 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015360"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/319983.319987"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.125"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.04.007"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . McGraw Hill , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. McGraw Hill, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871637_15"},{"key":"e_1_3_2_1_15_1","unstructured":"Dblp. http:\/\/www.informatik.uni-trier.de\/ ley\/db\/index.html.  Dblp. http:\/\/www.informatik.uni-trier.de\/ ley\/db\/index.html."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066168"},{"key":"e_1_3_2_1_17_1","volume-title":"Information Systems Working Papers","author":"Elmagarmid A.","year":"2006","unstructured":"A. Elmagarmid , P. G. Ipeirotis , and V. Verykios . Duplicate record detection: A survey . In Information Systems Working Papers , 2006 . A. Elmagarmid, P. G. Ipeirotis, and V. Verykios. Duplicate record detection: A survey. In Information Systems Working Papers, 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_3_2_1_19_1","volume-title":"Computers and Intractability","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability . W. H. Freeman and Company , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Company, 1979."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245280"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765751.1765788"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithms for Clustering Data","author":"Jain A. K.","year":"1988","unstructured":"A. K. Jain and R. C. Dubes . Algorithms for Clustering Data . Prentice Hall , 1988 . A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, 1988."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656435"},{"key":"e_1_3_2_1_25_1","unstructured":"I. Knowledge Partners. Business rules applied. http:\/\/www.kpiusa.com.  I. Knowledge Partners. Business rules applied. http:\/\/www.kpiusa.com."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_3_2_1_27_1","unstructured":"Lavastorm. Making the case for automated revenue assurance solutions. http:\/\/www.lavastormtech.com.  Lavastorm. Making the case for automated revenue assurance solutions. http:\/\/www.lavastormtech.com."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the SIGMOD Workshop on Data Mining and Knowledge Discovery","author":"Monge A.","year":"1997","unstructured":"A. Monge and C. Elkan . An efficient domain independent algorithm for detecting approximately duplicate database records . In Proceedings of the SIGMOD Workshop on Data Mining and Knowledge Discovery , Tucson, Arizona , May 1997 . A. Monge and C. Elkan. An efficient domain independent algorithm for detecting approximately duplicate database records. In Proceedings of the SIGMOD Workshop on Data Mining and Knowledge Discovery, Tucson, Arizona, May 1997."},{"key":"e_1_3_2_1_30_1","unstructured":"Trillium Inc. www.trilliumsoft.com\/trilliumsoft.nsf.  Trillium Inc. www.trilliumsoft.com\/trilliumsoft.nsf."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/645504.656273"}],"event":{"name":"SIGMOD\/PODS07: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Beijing China","acronym":"SIGMOD\/PODS07"},"container-title":["Proceedings of the 2007 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247530","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:45Z","timestamp":1750258305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1247480.1247530"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":31,"alternative-id":["10.1145\/1247480.1247530","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247530","relation":{},"subject":[],"published":{"date-parts":[[2007,6,11]]},"assertion":[{"value":"2007-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}