{"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":1750307924858,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"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.1247491","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Auditing disclosure by relevance ranking"],"prefix":"10.1145","author":[{"given":"Rakesh","family":"Agrawal","sequence":"first","affiliation":[{"name":"Microsoft Search Labs, Mountain View, CA"}]},{"given":"Alexandre","family":"Evfimievski","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}]},{"given":"Jerry","family":"Kiernan","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}]},{"given":"Raja","family":"Velu","sequence":"additional","affiliation":[{"name":"Yahoo! Inc., Sunnyvale, CA"}]}],"member":"320","published-online":{"date-parts":[[2007,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"30th Int'l Conf. on Very Large Data Bases","author":"Agrawal R.","year":"2004","unstructured":"R. Agrawal , R. Bayardo , C. Faloutsos , J. Kiernan , R. Rantzau , and R. Srikant . Auditing compliance using a hippocratic database . In 30th Int'l Conf. on Very Large Data Bases , Toronto , Canada, August 2004 . R. Agrawal, R. Bayardo, C. Faloutsos, J. Kiernan, R. Rantzau, and R. Srikant. Auditing compliance using a hippocratic database. In 30th Int'l Conf. on Very Large Data Bases, Toronto, Canada, August 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0097-x"},{"key":"e_1_3_2_1_3_1","unstructured":"Australian privacy act of 1998 1998. http:\/\/www.privacy.gov.au\/ACT\/privacyact\/. Australian privacy act of 1998 1998. http:\/\/www.privacy.gov.au\/ACT\/privacyact\/."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1995.10476563"},{"volume-title":"second session, thirty-sixth parliament, 48-49 elizabeth ii","year":"1999","key":"e_1_3_2_1_5_1","unstructured":"Personal information protection and electronic documents act , second session, thirty-sixth parliament, 48-49 elizabeth ii , 1999 -2000, statutes of canada, 2000. Personal information protection and electronic documents act, second session, thirty-sixth parliament, 48-49 elizabeth ii, 1999-2000, statutes of canada, 2000."},{"issue":"1","key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster , N. M. Laird , and D. B. Rubin . Maximum likelihood from incomplete data via the EM algorithm . Journal of the Royal Statistical Society , 39 ( 1 ): 1 -- 38 , 1977 . A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1):1--38, 1977.","journal-title":"Journal of the Royal Statistical Society"},{"key":"e_1_3_2_1_8_1","unstructured":"Official Journal of the European Communities 1995"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10501049"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/61.2.215"},{"key":"e_1_3_2_1_11_1","first-page":"1024","volume-title":"Handbook of Combinatorics","author":"Graham R. L.","unstructured":"R. L. Graham , M. Gr\u00f6tschel , and L. Lov\u00e1sz , editors . Handbook of Combinatorics , volume 2 , chapter 21, page 1024 . Elsevier Science B. V., 1995. R. L. Graham, M. Gr\u00f6tschel, and L. Lov\u00e1sz, editors. Handbook of Combinatorics, volume 2, chapter 21, page 1024. Elsevier Science B. V., 1995."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/2527783"},{"volume-title":"united states public law 104-191","year":"1996","key":"e_1_3_2_1_14_1","unstructured":"Health insurance portability and accountability act of 1996 , united states public law 104-191 , 1996 . http:\/\/www.hhs.gov\/ocr\/hipaa. Health insurance portability and accountability act of 1996, united states public law 104-191, 1996. http:\/\/www.hhs.gov\/ocr\/hipaa."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1989.10478785"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214501750332956"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2005.12"},{"key":"e_1_3_2_1_19_1","volume-title":"The EM Algorithmand Extensions","author":"McLachlan G.","year":"1996","unstructured":"G. McLachlan and T. Krishnan . The EM Algorithmand Extensions . Wiley-Interscience , November 1996 . G. McLachlan and T. Krishnan. The EM Algorithmand Extensions. Wiley-Interscience, November 1996."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/0471721182"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007633"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0105003"},{"key":"e_1_3_2_1_23_1","volume-title":"Rampant","author":"Nanda A.","year":"2003","unstructured":"A. Nanda and D. K. Burleson . Oracle Privacy Security Auditing . Rampant , 2003 . A. Nanda and D. K. Burleson. Oracle Privacy Security Auditing. Rampant, 2003."},{"key":"e_1_3_2_1_24_1","volume-title":"June","author":"President's Information Technology Advisory Committee","year":"2004","unstructured":"President's Information Technology Advisory Committee . Revolutionizing health care through information technology , June 2004 . President's Information Technology Advisory Committee. Revolutionizing health care through information technology, June 2004."},{"key":"e_1_3_2_1_25_1","volume-title":"Stochastic Complexity in Statistical Inquiry. World Scientific Publ","author":"Rissanen J.","year":"1989","unstructured":"J. Rissanen . Stochastic Complexity in Statistical Inquiry. World Scientific Publ . Co ., 1989 . J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Scientific Publ. Co., 1989."},{"key":"e_1_3_2_1_26_1","volume-title":"Integrated public use microdata series: Version 3.0","author":"Ruggles S.","year":"2004","unstructured":"S. Ruggles , M. Sobek , T. Alexander , C. A. Fitch , R. Goeken , P. K. Hall , M. King , and C. Ronnander . Integrated public use microdata series: Version 3.0 , 2004 . Machine-readable database. S. Ruggles, M. Sobek, T. Alexander, C. A. Fitch, R. Goeken, P. K. Hall, M. King, and C. Ronnander. Integrated public use microdata series: Version 3.0, 2004. Machine-readable database."},{"key":"e_1_3_2_1_27_1","volume-title":"Cambridge University Press, 1996","author":"Sachkov V. N.","year":"2004","unstructured":"V. N. Sachkov . Combinatorial Methods in Discrete Mathematics, chapter 4.2 . Cambridge University Press, 1996 . Result found in the 2-nd edition, in Russian , 2004 . V. N. Sachkov. Combinatorial Methods in Discrete Mathematics, chapter 4.2. Cambridge University Press, 1996. Result found in the 2-nd edition, in Russian, 2004."},{"key":"e_1_3_2_1_28_1","volume-title":"Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer","author":"Salton G.","year":"1989","unstructured":"G. Salton . Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer . Addison-Wesley , New York , 1989 . G. Salton. Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley, New York,1989."},{"volume-title":"March","year":"2006","key":"e_1_3_2_1_29_1","unstructured":"Wikipedia.org. Hungarian algorithm , March 2006 . Wikipedia.org. Hungarian algorithm, March 2006."},{"key":"e_1_3_2_1_30_1","first-page":"355","volume-title":"Business Survey Methods","author":"Winkler W. E.","year":"1995","unstructured":"W. E. Winkler . Matching and record linkage . In B. G. Cox, editor, Business Survey Methods , pages 355 -- 384 . Wiley , 1995 . W. E. Winkler. Matching and record linkage. In B. G. Cox, editor, Business Survey Methods, pages 355--384. Wiley, 1995."}],"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.1247491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1247480.1247491","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.1247491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,11]]},"references-count":28,"alternative-id":["10.1145\/1247480.1247491","10.1145\/1247480"],"URL":"https:\/\/doi.org\/10.1145\/1247480.1247491","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"}}]}}