Abstract
Data intensive peer-to-peer (P2P) networks are becoming increasingly popular in applications like social networking, file sharing networks, etc. Data mining in such P2P environments is the new generation of advanced P2P applications. Unfortunately, most of the existing data mining algorithms do not fit well in such environments since they require data that can be accessed in its entirety. It also is not easy due to the requirements of online transactional data streams. In this paper, we have developed a local algorithm for tracing frequent item sets over a P2P network. The performance of the proposed algorithm is comparatively tested and analyzed through a series of experiments.
Keywords
Cite this article
@article{cai-111284,
author = {Zahra Farzanyar and Mohammadreza Kangavari},
title = {Distributed Frequent Item Sets Mining over P2P Networks},
journal = {Computing and Informatics},
volume = {34},
number = {2},
pages = {458--472},
year = {2015},
issn = {1335-9150},
url = {https://cai.type.sk/content/2015/2/distributed-frequent-item-sets-mining-over-p2p-networks/}
}
TY - JOUR AU - Zahra Farzanyar AU - Mohammadreza Kangavari TI - Distributed Frequent Item Sets Mining over P2P Networks JO - Computing and Informatics VL - 34 IS - 2 SP - 458 EP - 472 PY - 2015 SN - 1335-9150 UR - https://cai.type.sk/content/2015/2/distributed-frequent-item-sets-mining-over-p2p-networks/ KW - Data stream mining KW - frequent item set mining KW - any time algorithm KW - distributed data mining KW - P2P data mining ER -
Farzanyar, Z., & Kangavari, M. (2015). Distributed Frequent Item Sets Mining over P2P Networks. Computing and Informatics, 34(2), 458–472. https://cai.type.sk/content/2015/2/distributed-frequent-item-sets-mining-over-p2p-networks/