High Confidence Association Rule for Product Selling Strategy
DOI:
https://doi.org/10.26438/ijcse/v7i6.11841188Keywords:
Association rules mining, Data Privacy, Data Mining, High confidenceAbstract
Mining association rules help data owners to unveil hidden patterns from their data to analyze & predict the operation on application domain. However, mining rules in a distributed environment is not a minor task due to privacy concerns. Data owners are interested in collaborating to mine rules on different levels; however, they are concerned that sensitive information related to somebody involved in their database might get compromised during the mining process. Here formulate the problem to solving association rules queries in a environment such that the mining process is confidential and the outcomes are differentially private. Work proposes a privacy-preserving association rules mining where strong association rules are determined privately, and the results returned satisfy differential privacy. Finally done experiments on real-life data it shows that designed approach can efficiently answer association rules queries and is scalable with increasing data records.
References
[1] R. Agrawal and R. Srikant. “Privacy preserving data mining”, InProceedings of International Conference on Management of Data (ACMSIGMOD), 2000.
[2] R. Bhaskar, S. Laxman, A. Smith, and A. Thakurta. “Discoveringfrequent patterns in sensitive data”. In Proc. of Intl. Conf. on Knowledge Discovery and Data Mining (KDD), pages 503–512, 2010.
[3] R. Chen, B. C. Fung, B. C. Desai, and N. M. Sossou. “Differentiallyprivate transit data publication: a case study on the Montrealtransportation system”. In Proc. of Intl. Conf. on Knowledge Discoveryand Data Mining (KDD), pages 213–221, 2012.
[4] G. Cormode, C. Procopiuc, E. Shen, D. Srivastava, and T. Yu.”Differentially private spatial decompositions.” In ICDE, pages 20–31, 2012.
[5] C. Dwork, F. McSherry, K. Nissim, and A. Smith. “Calibrating noiseto sensitivity in private data analysis”. In TCC, pages 265–284, 2006.
[6] C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. Vadhan.”On the complexity of differentially private data release: Efficient algorithms and hardness results”. In ACM Symposium on Theory ofComputing, pages 381–390, 2009.
[7] C. Dwork and A. Roth. “The algorithmic foundations of differentialprivacy”. Foundations and Trends in Theoretical Computer Science,9(34):211–407, 2014.
[8] A. Friedman and A. Schuster. “Data mining with differentialprivacy”. In Proc. of Intl. Conf. on Knowledge Discovery and DataMining (KDD), pages 493–502, 2010.
[9] A. Ghosh, T. Roughgarden, and M. Sundararajan. “Universally utility-maximizing privacy mechanisms”. In ACM Symposium onTheory of Computing, pages 351–360, 2009.
[10] Omar Abdel Wahab, Moulay Omar Hachami etal “DARM: A Privacy-preserving Approach for Distributed Association Rules Mining on Horizontally-partitioned Data”. Conference Paper • July 2014 DOI: 10.1145/2628194.2628206
[11] Pradeep Chouksey, "Mining Frequent model Using mass-produced Approach", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.4, pp.89-94, 2017
[12] P.V. Nikam, D.S. Deshpande, "Different Approaches for Frequent Itemset Mining", International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.2, pp.10-14, 2018.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
