International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 72 - Number 4 |
Year of Publication: 2013 |
Authors: D. Jaya Kumari, Nistala. V. E. S.murthy, S. Srinivasa Suresh |
10.5120/12479-8881 |
D. Jaya Kumari, Nistala. V. E. S.murthy, S. Srinivasa Suresh . An Optimization based Modified Maximum Sensitive Item-Sets Conflict First Algorithm (MSICF) for Hiding Sensitive Item-Sets. International Journal of Computer Applications. 72, 4 ( June 2013), 1-4. DOI=10.5120/12479-8881
In privacy preserving data mining, utility mining plays an important role. In privacy preserving utility mining, some sensitive itemsets are hidden from the database according to certain privacy policies. Hiding sensitive itemsets from the adversaries is becoming an important issue nowadays. Also, only very few methods are available in the literature to hide the sensitive itemsets in the database. The existing paper utilized two algorithms; such as HHUIF and MSICF are conceal the sensitive itemsets, so that the adversaries cannot mine them from the modified database. To accomplish the hiding process, this method finds the sensitive itemsets and modifies the frequency of the high valued utility items. But, the performance of this method lacks if the utility value of the items are same. To solve this problem, in this paper a modified MSICF algorithm with Item Selector (MMIS) is proposed. The MMIS algorithm computes the sensitive itemsets by utilizing the user defined utility threshold value. The proposed MMIS reduces the computation complexity as well as improves the hiding performance of the itemsets. The algorithm is implemented and the resultant itemsets are compared against the itemsets that are obtained from the conventional privacy preserving utility mining algorithms.