%0 Conference Paper %1 Emrah:ISCIS2010 %A Cem, Emrah %A Ozkasap, Oznur %B Proceedings of the 25th International Symposium on Computer and Information Sciences %D 2011 %I Springer Netherlands %K frequent myown practical profid %P 199-202 %R 10.1007/978-90-481-9794-1_40 %T ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks %U http://rd.springer.com/chapter/10.1007/978-90-481-9794-1_40?state=cookieless %X This 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.

@inproceedings{Emrah:ISCIS2010, abstract = {This 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. }, added-at = {2012-04-05T06:39:01.000+0200}, author = {Cem, Emrah and Ozkasap, Oznur}, biburl = {https://www.bibsonomy.org/bibtex/26c717d7c7d2c736c40df11241b3d7851/emrahcem}, booktitle = {Proceedings of the 25th International Symposium on Computer and Information Sciences}, description = {index.html}, doi = {10.1007/978-90-481-9794-1_40}, interhash = {9e43e16681c37d3547e84f4b1b9d1b3b}, intrahash = {6c717d7c7d2c736c40df11241b3d7851}, keywords = {frequent myown practical profid}, pages = {199-202}, publisher = {Springer Netherlands}, series = {Lecture Notes in Electrical Engineering}, timestamp = {2012-04-07T08:38:17.000+0200}, title = {ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks}, url = {http://rd.springer.com/chapter/10.1007/978-90-481-9794-1_40?state=cookieless}, year = 2011 }