IDEAS home Printed from https://ideas.repec.org/a/igg/jiit00/v2y2006i1p68-81.html
   My bibliography  Save this article

Rapid Privacy Preserving Algorithm for Large Databases

Author

Listed:
  • K. Anbumani

    (Karunya Institute of Technology and Sciences (Deemed University), India)

  • R. Nedunchezhian

    (Sri Ramakrishna Engineering College, India)

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.

Suggested Citation

  • K. Anbumani & R. Nedunchezhian, 2006. "Rapid Privacy Preserving Algorithm for Large Databases," International Journal of Intelligent Information Technologies (IJIIT), IGI Global, vol. 2(1), pages 68-81, January.
    • Handle: RePEc:igg:jiit00:v:2:y:2006:i:1:p:68-81
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jiit.2006010104
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jiit00:v:2:y:2006:i:1:p:68-81. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.