Volume- 5
Issue- 3
Year- 2017
DOI: 10.21276/ijircst.2017.5.3.2 | DOI URL: https://doi.org/10.21276/ijircst.2017.5.3.2 Crossref
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
Nithin C , A V Krishna Mohan
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.
[1] 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.
[2] 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.
[3] 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.
[4] 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.
[5] J. Dean and S. Ghemawat, “MapReduce: Simplified data processing on large clusters,” Commun. ACM, vol. 51, no. 1, pp. 107–113, Jan. 2008.
Department of Computer Science & Engineering, Siddaganga Institute of Technology, Tumakuru, India
No. of Downloads: 6 | No. of Views: 903
Anu Sharma, Vivek Kumar.
May 2023 - Vol 11, Issue 3
Venkateswaran Radhakrishnan.
May 2023 - Vol 11, Issue 3
Heemakshi Sharma, Khushboo Tripathi.
May 2023 - Vol 11, Issue 3