An Efficient Method for Protecting High Utility Itemsets in Utility Mining

Privacy preserving data mining (PPDM) has become a popular research direction in data mining. Privacy preserving data mining is an approach to develop algorithms by which we can modify the utility values of original data using some techniques in order to protect sensitive information from unauthorized user. Protecting data against illegal access becomes a serious issue when this data is required to be shared onto the network due to some reasons. To hide the sensitive information, many approaches have been proposed. In this study, we are proposing an efficient method, for protecting high utility itemsets using distortion technique where the values for high utility items are altered to achieve the privacy. Algorithm is designed in such a way so as to handle privacy without disclosure of sensitive information. The algorithm can completely hide any given utility items by scanning data iteratively. The results when compared with existing one show significant reduction in execution time.

[1]  David J. DeWitt,et al.  Mondrian Multidimensional K-Anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[2]  Chin-Chen Chang,et al.  A Fast Algorithm for Mining Share-Frequent Itemsets , 2005, APWeb.

[3]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[4]  Stanley Robson de Medeiros Oliveira,et al.  Privacy preserving frequent itemset mining , 2002 .

[5]  Latanya Sweeney,et al.  Achieving k-Anonymity Privacy Protection Using Generalization and Suppression , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[6]  Chris Clifton,et al.  Using unknowns to prevent discovery of association rules , 2001, SGMD.

[7]  Abhishek Agrawal,et al.  Efficiency Enhanced Association Rule Mining Technique , 2011 .

[8]  Howard J. Hamilton,et al.  A Unified Framework for Utility Based Measures for Mining Itemsets , 2006 .

[9]  Jieh-Shan Yeh,et al.  HHUIF and MSICF: Novel algorithms for privacy preserving utility mining , 2010, Expert Syst. Appl..

[10]  Chin-Chen Chang,et al.  Direct Candidates Generation: A Novel Algorithm for Discovering Complete Share-Frequent Itemsets , 2005, FSKD.

[11]  Rishi Soni,et al.  Secure Multi-party Communication in Data-mining Applications , 2015 .

[12]  Chinchen Chang,et al.  EFFICIENT ALGORITHMS FOR MINING SHARE-FREQUENT ITEMSETS , 2005 .

[13]  Chin-Chen Chang,et al.  Isolated items discarding strategy for discovering high utility itemsets , 2008, Data Knowl. Eng..

[14]  S. Jayanthi,et al.  A Fast Algorithm for Mining High Utility Itemsets , 2009, 2009 IEEE International Advance Computing Conference.

[15]  Osmar R. Zaïane,et al.  Privacy Preserving Clustering by Data Transformation , 2010, J. Inf. Data Manag..

[16]  Ira S. Moskowitz,et al.  An Integrated Framework for Database Privacy Protection , 2000, DBSec.

[17]  Cory J. Butz,et al.  A Foundational Approach to Mining Itemset Utilities from Databases , 2004, SDM.

[18]  Shyue-Liang Wang,et al.  Hiding sensitive items in privacy preserving association rule mining , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[19]  Jian Xu,et al.  Utility-based anonymization for privacy preservation with less information loss , 2006, SKDD.

[20]  Shan-Tai Chen,et al.  A Novel Algorithm for Completely Hiding Sensitive Association Rules , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

[21]  Aris Gkoulalas-Divanis,et al.  Association Rule Hiding for Data Mining , 2010, Advances in Database Systems.

[22]  Elisa Bertino,et al.  Hiding Association Rules by Using Confidence and Support , 2001, Information Hiding.

[23]  Yücel Saygin,et al.  Privacy preserving association rule mining , 2002, Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems RIDE-2EC 2002.

[24]  Vassilios S. Verykios,et al.  Disclosure limitation of sensitive rules , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).