Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Distributed Frequent Item Sets Mining over P2P Networks

In: Computing and Informatics, vol. 34, no. 2
Z. Farzanyar - M. Kangavari

Details:

Year, pages: 2015, 458 - 472
Keywords:
Data stream mining, frequent item set mining, any time algorithm, distributed data mining, P2P data mining
About article:
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.
How to cite:
ISO 690:
Farzanyar, Z., Kangavari, M. 2015. Distributed Frequent Item Sets Mining over P2P Networks. In Computing and Informatics, vol. 34, no.2, pp. 458-472. 1335-9150.

APA:
Farzanyar, Z., Kangavari, M. (2015). Distributed Frequent Item Sets Mining over P2P Networks. Computing and Informatics, 34(2), 458-472. 1335-9150.