BibTeX:

@article{IJIRSTV1I10046,
     title={Privacy Preserving Data Mining Using Heuristic Approach},
     author={Maulesh r. Chhatrapati and Shilpa Sherasiya},
     journal={International Journal for Innovative Research in Science & Technology},
     volume={1},
     number={10},
     pages={113--117},
     year={},
     url={http://www.ijirst.org/articles/IJIRSTV1I10046.pdf},
     publisher={IJIRST (International Journal for Innovative Research in Science & Technology)},
}

Data mining is the process of identifying patterns from large amount of data. Association rule mining aims to discover dependency relationships across attributes. It may also disclose sensitive information. With extensive application of data mining techniques to various domains, privacy preservation becomes mandatory. It has become a very important area of concern but still this branch of research is in its infancy .People today have become well aware of the privacy intrusions of their sensitive data and are very reluctant to share their information. Association rule hiding is one of the techniques of privacy preserving data mining to protect the sensitive association rules generated by association rule mining. There are many approaches to hide association rule. In this paper Efficient Heuristic approach method is proposed which is more effective to hide association rule. This paper adopts heuristic approach for hiding sensitive association rules. The proposed technique makes the representative rules and hides the sensitive rules. The objective of this algorithm is to extract relevant knowledge from large amount of data, while protecting at the time sensitive information. In this paper we also focused to hide multiple sensitive item without affecting other sensitive items.

heuristic approach, Minimum Confidence, Minimum Support, Item set, Association rules