Privacy-Preserving in FiDoop, Mining of  Frequent Itemsets from Outsourced  Transaction Databases

Authors

  • Nithin C Department of Computer Science & Engineering, Siddaganga Institute of Technology, Tumakuru, India. Author
  • A V Krishna Mohan Assistant Proffesor, Department of Computer Science & Engineering, Siddaganga Institute of Technology, Tumakuru, India. Author

Abstract

Distributed computing has helped enthusiasm  for a worldview called Datamining-as-a-service. This  framework is useful for the organizations lack in specialized  persons and processing asset empower to compute ,it enforces  them to outsource their information to the outsider for data  mining undertakings. In this work, we examine the strategy  to safeguard security for frequent itemset mining in  outsourced exchange databases and utilizing FiDoop  calculation to process the infrequent itemsets from the  outsourced datasets on the server side. A novel strategy used  to accomplish k-support anonymity in light of measurable  perceptions on the datasets to safeguard the security of the  outsourced dataset. To decide frequent itemset at the  distributed computing side from the database that gotten  from various associations by utilizing a parallel mining for  frequent itemsets, algorithm called FiDoop utilizing the  programming model of MapReduce. FiDoop coordinate  frequent itemset ultrametric (FIU)tree rather than  customary FP-tree to empower the packed stockpiling of the  mined information and to stay away from conditional pattern  based information. Three MapReduce tasks are utilized to  mine the information from the outsourced data. In the  significant third MapReduce undertaking, the mappers  autonomously break down itemsets that delivered from  second MapReduce, the reducers perform blend operations  by building FIU-tree. 

Downloads

Download data is not yet available.

References

1 F. Giannotti, L. V. S. Lakshmanan, A. Monreale, D. Pedreschi, and W.H. Wang," Privacy-preserving mining of association rules from outsourced transaction databases.," IEEE Systems Journal, pp. 385-395, Vol.7,No.3,2013.

L. Sweeney, "k-anonymity: A model for protecting privacy," International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, Vol. 10, No. 5, pp. 557-570,2002.

C-H Tai, P. S. Yu, and M-S Chen, "k-support anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining," ACM SIGKDD international conference on Knowledge Discovery ,July 2010.

Y.-J. Tsay, T.-J. Hsu, and J.-R. Yu, “FIUT: A new method for mining frequent itemsets,” Inf. Sci., vol. 179, no. 11, pp. 1724–1737, 2009.

J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Commun. ACM, vol. 51, no. 1, pp. 107–113, Jan. 2008.

Downloads

Published

2017-05-09

How to Cite

Privacy-Preserving in FiDoop, Mining of  Frequent Itemsets from Outsourced  Transaction Databases. (2017). International Journal of Innovative Research in Computer Science & Technology, 5(3), 268–273. Retrieved from https://acspublisher.com/journals/index.php/ijircst/article/view/13449