{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:49:30Z","timestamp":1760402970853,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T00:00:00Z","timestamp":1587081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Data publishing is a challenging task for privacy preservation constraints. To ensure privacy, many anonymization techniques have been proposed. They differ in terms of the mathematical properties they verify and in terms of the functional objectives expected. Disassociation is one of the techniques that aim at anonymizing of set-valued datasets (e.g., discrete locations, search and shopping items) while guaranteeing the confidentiality property known as     k m    -anonymity. Disassociation separates the items of an itemset in vertical chunks to create ambiguity in the original associations. In a previous work, we defined a new ant-based clustering algorithm for the disassociation technique to preserve some items associated together, called utility rules, throughout the anonymization process, for accurate analysis. In this paper, we examine the disassociated dataset in terms of knowledge extraction. To make data analysis easy on top of the anonymized dataset, we define neighbor datasets or in other terms datasets that are the result of a probabilistic re-association process. To assess the neighborhood notion set-valued datasets are formalized into trees and a tree edit distance (TED) is directly applied between these neighbors. Finally, we prove the faithfulness of the neighbors to knowledge extraction for future analysis, in the experiments.<\/jats:p>","DOI":"10.3390\/fi12040071","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T03:23:06Z","timestamp":1587439386000},"page":"71","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Publishing Anonymized Set-Valued Data via Disassociation towards Analysis"],"prefix":"10.3390","volume":"12","author":[{"given":"Nancy","family":"Awad","sequence":"first","affiliation":[{"name":"Femto-ST Institute, UMR 6174 CNRS, University of Bourgogne-Franche-Comte, 25000 Besan\u00e7on, France"},{"name":"TICKET Labortary, Antonine University, Hadat-Baabda 1003, Lebanon"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6437-5598","authenticated-orcid":false,"given":"Jean-Francois","family":"Couchot","sequence":"additional","affiliation":[{"name":"Femto-ST Institute, UMR 6174 CNRS, University of Bourgogne-Franche-Comte, 25000 Besan\u00e7on, France"}]},{"given":"Bechara","family":"Al Bouna","sequence":"additional","affiliation":[{"name":"TICKET Labortary, Antonine University, Hadat-Baabda 1003, Lebanon"}]},{"given":"Laurent","family":"Philippe","sequence":"additional","affiliation":[{"name":"Femto-ST Institute, UMR 6174 CNRS, University of Bourgogne-Franche-Comte, 25000 Besan\u00e7on, France"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Awad, N., Couchot, J.F., Bouna, B.A., and Philippe, L. (2019, January 10\u201312). Ant-driven clustering for utility-aware disassociation of set-valued datasets. Proceedings of the 23rd International Database Applications & Engineering Symposium, Athens, Greece.","DOI":"10.1145\/3331076.3331084"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"944","DOI":"10.14778\/2336664.2336668","article-title":"Privacy Preservation by Disassociation","volume":"5","author":"Terrovitis","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"ref_3","first-page":"944","article-title":"Differential privacy","volume":"5","author":"Dwork","year":"2011","journal-title":"Encycl. Cryptogr. Secur."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","article-title":"Protecting Respondents\u2019 Identities in Microdata Release","volume":"13","author":"Samarati","year":"2001","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","article-title":"k-Anonymity: A Model for Protecting Privacy","volume":"10","author":"Sweeney","year":"2002","journal-title":"Int. J. Uncertain. Fuzzy. Knowl. Syst."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Xiao, X., and Tao, Y. (2006, January 12\u201315). Anatomy: Simple and effective Privacy Preservation. Proceedings of the 32nd International Conference on Very Large Data Bases (VLDB 2006), Seoul, Korea.","DOI":"10.1145\/1142473.1142500"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/TKDE.2010.236","article-title":"Slicing: A New Approach for Privacy Preserving Data Publishing","volume":"24","author":"Li","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"De Capitani di Vimercati, S., Foresti, S., Jajodia, S., Livraga, G., Paraboschi, S., and Samarati, P. (2013). Extending Loose Associations to Multiple Fragments. Data and Applications Security and Privacy, Springer-Verlag.","DOI":"10.1007\/978-3-642-39256-6_1"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ins.2016.01.100","article-title":"Generalized bucketization scheme for flexible privacy settings","volume":"348","author":"Wang","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"23648","DOI":"10.1109\/ACCESS.2018.2814622","article-title":"Two Privacy-Preserving Approaches for Publishing Transactional Data Streams","volume":"6","author":"Wang","year":"2018","journal-title":"IEEE Access"},{"key":"ref_11","unstructured":"Vattani, A. (2020, April 16). The hardness of k-means clustering in the plane. Available online: http:\/\/cseweb.ucsd.edu\/avattani\/papers\/kmeans_hardness.pdf."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Brucker, P. (1978). On the complexity of clustering problems. Optimization and Operations Research, Springer.","DOI":"10.1007\/978-3-642-95322-4_5"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","article-title":"FCM: The fuzzy c-means clustering algorithm","volume":"10","author":"Bezdek","year":"1984","journal-title":"Comput. Geosci."},{"key":"ref_14","unstructured":"MacQueen, J. (July, January 21). Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Kennedy, J. (2010). Particle swarm optimization. Encycl. Mach. Learn., 760\u2013766.","DOI":"10.1007\/978-0-387-30164-8_630"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","article-title":"A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm","volume":"39","author":"Karaboga","year":"2007","journal-title":"J. Glob. Optim."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Deneubourg, J.L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., and Chr\u00e9tien, L. (1990, January 24\u201328). The dynamics of collective sorting robot-like ants and ant-like robots. Proceedings of the First International Conference on Simulation of Adaptive Behavior on from Animals to Animats, Paris, France.","DOI":"10.7551\/mitpress\/3115.003.0048"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Sadeghi, Z., and Teshnehlab, M. (2008, January 24\u201327). Ant colony clustering by expert ants. Proceedings of the 2008 11th International Conference on Computer and Information Technology, Khulna, Bangladesh.","DOI":"10.1109\/ICCITECHN.2008.4803115"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.knosys.2015.04.007","article-title":"Integration of graph clustering with ant colony optimization for feature selection","volume":"84","author":"Moradi","year":"2015","journal-title":"Knowl. Syst."},{"key":"ref_21","unstructured":"Labroche, N., Monmarch\u00e9, N., and Venturini, G. (2002, January 21\u201326). A new clustering algorithm based on the chemical recognition system of ants. Proceedings of the 15th Eureopean Conference on Artificial Intelligence, Lyon, France."},{"key":"ref_22","first-page":"28","article-title":"Ant colony optimization","volume":"4","author":"Dorigo","year":"2010","journal-title":"IEEE Computat. Intell. Mag."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2699485","article-title":"Efficient computation of the tree edit distance","volume":"40","author":"Pawlik","year":"2015","journal-title":"ACM Trans. Database Syst."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.is.2015.08.004","article-title":"Tree edit distance: Robust and memory-efficient","volume":"56","author":"Pawlik","year":"2016","journal-title":"Inf. Syst."},{"key":"ref_25","first-page":"1","article-title":"arules-A computational environment for mining association rules and frequent item sets","volume":"14","author":"Hornik","year":"2005","journal-title":"J. Stat. Softw."},{"key":"ref_26","first-page":"1","article-title":"Introduction to arules\u2013mining association rules and frequent item sets","volume":"2","author":"Hahsler","year":"2007","journal-title":"SIGKDD Explor."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/12\/4\/71\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:08:57Z","timestamp":1760364537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/12\/4\/71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,17]]},"references-count":26,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["fi12040071"],"URL":"https:\/\/doi.org\/10.3390\/fi12040071","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2020,4,17]]}}}