We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Reseach Article

Hierarchial Approach for Frequent Closed Itemset Generation in Distributed Environment

by Aditi Site, Muralidhar A
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 108 - Number 17
Year of Publication: 2014
Authors: Aditi Site, Muralidhar A
10.5120/19001-0476

Aditi Site, Muralidhar A . Hierarchial Approach for Frequent Closed Itemset Generation in Distributed Environment. International Journal of Computer Applications. 108, 17 ( December 2014), 8-10. DOI=10.5120/19001-0476

@article{ 10.5120/19001-0476,
author = { Aditi Site, Muralidhar A },
title = { Hierarchial Approach for Frequent Closed Itemset Generation in Distributed Environment },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 108 },
number = { 17 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 8-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume108/number17/19001-0476/ },
doi = { 10.5120/19001-0476 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:43:12.739956+05:30
%A Aditi Site
%A Muralidhar A
%T Hierarchial Approach for Frequent Closed Itemset Generation in Distributed Environment
%J International Journal of Computer Applications
%@ 0975-8887
%V 108
%N 17
%P 8-10
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper addresses the issue of generating the frequent closed Itemset in distributed environment. Some algorithms have been proposed earlier there but they are suffering from the drawbacks like: Increasing communication load or frequent communication between the nodes for transferring information. So some algorithm need to be proposed which could solve these two drawbacks simultaneously and this paper have propose one such algorithm so that the mining of the datasets present in the distributed environment could be done effectively and with less theoretical complexity.

References
  1. Jianming Lin, Chunhuan Ju, Dongsheng Liu:'An Efficient Mining Model for Global Frequent Closed Itemsets' Second International Symposium on Electronics Commerce and Society 2009.
  2. Mohsen Kahani, H. W. Peter Beadle:'Decentralised Approaches for Network Management 2010'.
  3. A. Tiwari , R. K. Gupta and D. P. Agrawal:'A survey on Frequent Pattern Mining: Current Status and Chalenging Issues' Information Technology Jounal 2010'.
  4. Claudio Lucchesse, Salvatore Orlando and Raffaele Perego:'Fast and Memory Efficient Mining of Frequent Closed Itemsets' IEEE transactions on Knowledge and Data Engineering 2006.
  5. Mohammed J. Zaki:'Efficient Algorithms for Mining Closed Itemsets and their Lattice Structure' IEEE transactions on Knowledge and Data Engineering 2005.
  6. Damianos Gavalas, Dominic Greenwood, Mohammed Ghanbari, Mike O'Mahony:' Heirarchial Network Management 2010.
  7. Cheng, W. C. H. ,Xiaohua Jia: 'Heirarchial framework for designing reliable distributed systems 1995'.
  8. Troubitsyna, E. ,: 'Developing Fault tolerant Distributed System by Refinement' 2010.
  9. Mohammed J. Zaki: 'Closed Itemset Mining and Non-Redundant Asoociation Rule Mining'2006.
  10. Guinea, S. Saeedi, P. : 'Coordination of Distributed systems through self organizing topologies'2012.
Index Terms

Computer Science
Information Sciences

Keywords

Frequent closed item-sets global and local frequent closed itemsets hierarchial system distributed environment subset examination techniques