{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T08:59:04Z","timestamp":1791017944525,"version":"4.1.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"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. Web"],"published-print":{"date-parts":[[2010,7]]},"abstract":"<jats:p>We introduce the concern of confidentiality protection of business information for the publication of search engine query logs and derived data. We study business confidentiality, as the protection of nonpublic data from institutions, such as companies and people in the public eye. In particular, we relate this concern to the involuntary exposure of confidential Web site information, and we transfer this problem into the field of privacy-preserving data mining. We characterize the possible adversaries interested in disclosing Web site confidential data and the attack strategies that they could use. These attacks are based on different vulnerabilities found in query log for which we present several anonymization heuristics to prevent them. We perform an experimental evaluation to estimate the remaining utility of the log after the application of our anonymization techniques. Our experimental results show that a query log can be anonymized against these specific attacks while retaining a significant volume of useful data.<\/jats:p>","DOI":"10.1145\/1806916.1806919","type":"journal-article","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T15:37:32Z","timestamp":1279640252000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Privacy-preserving query log mining for business confidentiality protection"],"prefix":"10.1145","volume":"4","author":[{"given":"Barbara","family":"Poblete","sequence":"first","affiliation":[{"name":"Yahoo! Research Chile, Santiago, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Myra","family":"Spiliopoulou","sequence":"additional","affiliation":[{"name":"Otto von Guericke University, Magdeburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ricardo","family":"Baeza-Yates","sequence":"additional","affiliation":[{"name":"Yahoo! Research Spain, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Workshop in Query Log Analysis: Social and Technological Challenges (WWW'07)","author":"Adar E.","year":"2007"},{"key":"e_1_2_1_2_1","volume-title":"-L","author":"Albert R.","year":"2000"},{"key":"e_1_2_1_3_1","unstructured":"AOL. AOL Research Web site no longer online. http:\/\/research.aol.com.  AOL. AOL Research Web site no longer online. http:\/\/research.aol.com."},{"key":"e_1_2_1_4_1","unstructured":"Arrington M. 2006. AOL proudly releases massive amounts of private data. http:\/\/www.techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/.  Arrington M. 2006. AOL proudly releases massive amounts of private data. http:\/\/www.techcrunch.com\/2006\/08\/06\/aol-proudly-releases-massive-amounts-of-user-search-data\/."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_1"},{"key":"e_1_2_1_6_1","unstructured":"Baeza-Yates R. Jones R. and Poblete B. 2010. Issues with privacy preservation in query log mining. In Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques F. Bonchi and E. Ferrari Eds. Chapman and Hall\/CRC Press.  Baeza-Yates R. Jones R. and Poblete B. 2010. Issues with privacy preservation in query log mining. In Privacy-Aware Knowledge Discovery: Novel Applications and New Techniques F. Bonchi and E. Ferrari Eds. Chapman and Hall\/CRC Press."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281204"},{"key":"e_1_2_1_8_1","unstructured":"Barbaro M. and Zeller T. 2006. A face is exposed for AOL searcher no. 4417749. New York Times.  Barbaro M. and Zeller T. 2006. A face is exposed for AOL searcher no. 4417749. New York Times."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/792550.792552"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000008"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the National Science Foundation Workshop on Next Generation Data Mining.","author":"Clifton C.","year":"2002"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409220.1409222"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321573"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242657"},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Computer Science.","volume-title":"Proceedings of the 1st SIGKDD International Workshop on Privacy, Security, and Trust in KDD (PinKDD'07)","author":"Poblete B."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/310930.310982"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974131"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.2307\/41166000"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6386(199801\/03)9:1<44::AID-CIR8>3.0.CO;2-A"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806916.1806919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806916.1806919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:38Z","timestamp":1750246778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806916.1806919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["10.1145\/1806916.1806919"],"URL":"https:\/\/doi.org\/10.1145\/1806916.1806919","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"value":"1559-1131","type":"print"},{"value":"1559-114X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]},"assertion":[{"value":"2007-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}