Department of Computer Engineering2024-11-0920109789-0481-9793-41876-110010.1007/978-90-481-9794-1_402-s2.0-78651542098http://dx.doi.org/10.1007/978-90-481-9794-1_40https://hdl.handle.net/20.500.14288/8474This study addresses the problem of discovering frequent items in unstructured P2P networks. We propose a fully distributed Protocol for Frequent Item set Discovery (ProFID) where the result is produced at every peer. We also propose a practical rule for convergence of the algorithm. Finally, we evaluate the efficiency of our approach through an extensive simulation study on PeerSim.Computer engineeringConference proceedinghttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78651542098anddoi=10.1007%2f978-90-481-9794-1_40andpartnerID=40andmd5=ba26a5cd1b280fc1d03ad8ef8a621ff2N/A6421