文章基本信息

标题：An Efficient Method to Identify the Most Frequent Item Sets Using Database Count Algorithm and Effective Aco Algorithm in a Peer to Peer Network
本地全文：下载
作者：S.Veena ; DR.P.Rangarajan
期刊名称：International Journal of Computer Trends and Technology
电子版ISSN：2231-2803
出版年度：2014
卷号：17
期号：6
页码：300-303
DOI：10.14445/22312803/IJCTT-V17P153
出版社：Seventh Sense Research Group
摘要：A peertopeer (P2P) network is one that does not have fixed clients and servers but a number of peer nodes that function as both clients and servers to the other nodes in the network. Association Rule Mining can be used for discovering hidden relationship between items stored in various nodes in the network . By given a userspecified threshold, also known as minimum support, the mining of association rules can discover the complete set of frequent patterns. In this paper, a Database count algorithm is used to mine the local frequent item sets and then generate the global frequent item sets from a Peer to peer network. Then the global item sets are optimized by using the Effective Ant colony Optimization algorithm to generate the most frequent item sets.
关键词：Peer to Peer network; Database Count algorithm; Effective Ant Colony Optimization algorithm.