Rapid Privacy Preserving Algorithm for Large Databases

K. Anbumani and R. Nedunchezhian
Additional contact information
K. Anbumani: Karunya Institute of Technology and Sciences (Deemed University), India
R. Nedunchezhian: Sri Ramakrishna Engineering College, India

International Journal of Intelligent Information Technologies (IJIIT), 2006, vol. 2, issue 1, 68-81

Abstract: Data mining techniques have been widely used for extracting non-trivial information from massive amounts of data. They help in strategic decision-making as well as many more applications. However, data mining also has a few demerits apart from its usefulness. Sensitive information contained in the database may be brought out by the data mining tools. Different approaches are being utilized to hide the sensitive information. The proposed work in this article applies a novel method to access the generating transactions with minimum effort from the transactional database. It helps in reducing the time complexity of any hiding algorithm. The theoretical and empirical analysis of the algorithm shows that hiding of data using this proposed work performs association rule hiding quicker than other algorithms.

Date: 2006
References: Add references at CitEc
Citations:

Downloads: (external link)
https://services.igi-global.com/resolvedoi/resolve ... 4018/jiit.2006010104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jiit00:v:2:y:2006:i:1:p:68-81

Access Statistics for this article

International Journal of Intelligent Information Technologies (IJIIT) is currently edited by Vijayan Sugumaran

More articles in International Journal of Intelligent Information Technologies (IJIIT) from IGI Global
Bibliographic data for series maintained by Journal Editor ().