Achieving k-anonymity for associative classification in incremental-data scenarios

• Main Authors: Bowonsak Seisungsittisunti, Juggapong Natwichai
• Format: Book Series
• Published: 2018
• Subjects: Computer Science
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=80655143423&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/49867
• Institution: Chiang Mai University

When a data mining model is to be developed, one of the most important issues is preserving the privacy of the input data. In this paper, we address the problem of data transformation to preserve the privacy with regard to a data mining technique, associative classification, in an incremental-data scenario. We propose an incremental polynomial-time algorithm to transform the data to meet a privacy standard, i.e. k-Anonymity. While the transformation can still preserve the quality to build the associative classification model. The computational complexity of the proposed incremental algorithm ranges from O(n log n) to O( Δn) depending on the characteristic of increment data. The experiments have been conducted to evaluate the proposed work comparing with a non-incremental algorithm. From the experiment result, the proposed incremental algorithm is more efficient in every problem setting. © 2011 Springer-Verlag.