{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T16:25:48Z","timestamp":1791908748458,"version":"4.3.4"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p>\n            In this work, we focus on protection against identity disclosure in the publication of sparse multidimensional data. Existing multidimensional anonymization techniques\n            <jats:italic>(a)<\/jats:italic>\n            protect the privacy of users either by altering the set of quasi-identifiers of the original data (e.g., by generalization or suppression) or by adding noise (e.g., using differential privacy) and\/or\n            <jats:italic>(b)<\/jats:italic>\n            assume a clear distinction between sensitive and non-sensitive information and sever the possible linkage. In many real world applications the above techniques are not applicable. For instance, consider web search query logs. Suppressing or generalizing anonymization methods would remove the most valuable information in the dataset: the original query terms. Additionally, web search query logs contain millions of query terms which cannot be categorized as sensitive or non-sensitive since a term may be sensitive for a user and non-sensitive for another. Motivated by this observation, we propose an anonymization technique termed\n            <jats:italic>disassociation<\/jats:italic>\n            that preserves the original terms but hides the fact that two or more different terms appear in the same record. We protect the users' privacy by disassociating record terms that participate in identifying combinations. This way the adversary cannot associate with high probability a record with a rare combination of terms. To the best of our knowledge, our proposal is the first to employ such a technique to provide protection against\n            <jats:italic>identity disclosure<\/jats:italic>\n            . We propose an anonymization algorithm based on our approach and evaluate its performance on real and synthetic datasets, comparing it against other state-of-the-art methods based on generalization and differential privacy.\n          <\/jats:p>","DOI":"10.14778\/2336664.2336668","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"944-955","source":"Crossref","is-referenced-by-count":64,"title":["Privacy preservation by disassociation"],"prefix":"10.14778","volume":"5","author":[{"given":"Manolis","family":"Terrovitis","sequence":"first","affiliation":[{"name":"IMIS, Research Center 'Athena'"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"Univ. of Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Liagouris","sequence":"additional","affiliation":[{"name":"NTUA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spiros","family":"Skiadopoulos","sequence":"additional","affiliation":[{"name":"Univ. of Peloponnese"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,6]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"901","volume-title":"VLDB","author":"Aggarwal C.","year":"2005","unstructured":"C. Aggarwal . On k-anonymity and the curse of dimensionality . In VLDB , pp. 901 -- 909 , 2005 . C. Aggarwal. On k-anonymity and the curse of dimensionality. In VLDB, pp. 901--909, 2005."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0034-x"},{"key":"e_1_2_1_3_1","volume-title":"New York Times","author":"Barbaro M.","year":"2006","unstructured":"M. Barbaro and T. Zeller . A face is exposed for AOL searcher no. 4417749 . New York Times , 2006 . M. Barbaro and T. Zeller. A face is exposed for AOL searcher no. 4417749. New York Times, 2006."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2019312.2019315"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920971"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402744"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1805974.1805978"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453947"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316764"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497480"},{"key":"e_1_2_1_12_1","first-page":"420","volume-title":"VLDB","author":"Han J.","year":"1995","unstructured":"J. Han and Y. Fu . Discovery of multiple-level association rules from large databases . In VLDB , pp. 420 -- 431 , 1995 . J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In VLDB, pp. 420--431, 1995."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687733"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526733"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.101"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.52"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.236"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0911686107"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.03.009"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.369025"},{"key":"e_1_2_1_23_1","volume-title":"http:\/\/www.netflixprize.com\/faq","author":"FAQ.","year":"2009","unstructured":"Netflix Prize FAQ. http:\/\/www.netflixprize.com\/faq , 2009 . Netflix Prize FAQ. http:\/\/www.netflixprize.com\/faq, 2009."},{"key":"e_1_2_1_24_1","volume-title":"Embellishing text search queries to protect user privacy. PVLDB, 3(1--2): 598--607","author":"Pang H.","year":"2010","unstructured":"H. Pang , X. Ding , and X. Xiao . Embellishing text search queries to protect user privacy. PVLDB, 3(1--2): 598--607 , 2010 . H. Pang, X. Ding, and X. Xiao. Embellishing text search queries to protect user privacy. PVLDB, 3(1--2): 598--607, 2010."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453874"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0192-8"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/319950.320054"},{"key":"e_1_2_1_30_1","first-page":"139","volume-title":"VLDB","author":"Xiao X.","year":"2006","unstructured":"X. Xiao and Y Tao . Anatomy : simple and effective privacy preservation . In VLDB , pp. 139 -- 150 , 2006 . X. Xiao and Y Tao. Anatomy: simple and effective privacy preservation. In VLDB, pp. 139--150, 2006."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401982"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516370"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502572"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2336664.2336668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:45:27Z","timestamp":1672224327000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2336664.2336668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":33,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.14778\/2336664.2336668"],"URL":"https:\/\/doi.org\/10.14778\/2336664.2336668","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}