Publication: ProFID: practical frequent item set discovery in peer-to-peer networks
dc.contributor.coauthor | N/A | |
dc.contributor.department | Department of Computer Engineering | |
dc.contributor.department | N/A | |
dc.contributor.kuauthor | Özkasap, Öznur | |
dc.contributor.kuauthor | Çem, Emrah | |
dc.contributor.kuprofile | Faculty Member | |
dc.contributor.kuprofile | PhD Student | |
dc.contributor.other | Department of Computer Engineering | |
dc.contributor.schoolcollegeinstitute | College of Engineering | |
dc.contributor.schoolcollegeinstitute | Graduate School of Sciences and Engineering | |
dc.contributor.yokid | 113507 | |
dc.contributor.yokid | N/A | |
dc.date.accessioned | 2024-11-09T23:03:35Z | |
dc.date.issued | 2010 | |
dc.description.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. | |
dc.description.indexedby | Scopus | |
dc.description.openaccess | YES | |
dc.description.publisherscope | International | |
dc.description.volume | 62 LNEE | |
dc.identifier.doi | 10.1007/978-90-481-9794-1_40 | |
dc.identifier.isbn | 9789-0481-9793-4 | |
dc.identifier.issn | 1876-1100 | |
dc.identifier.link | https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651542098anddoi=10.1007%2f978-90-481-9794-1_40andpartnerID=40andmd5=ba26a5cd1b280fc1d03ad8ef8a621ff2 | |
dc.identifier.quartile | N/A | |
dc.identifier.scopus | 2-s2.0-78651542098 | |
dc.identifier.uri | http://dx.doi.org/10.1007/978-90-481-9794-1_40 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14288/8474 | |
dc.keywords | Distributed protocols | |
dc.keywords | Extensive simulations | |
dc.keywords | Frequent items | |
dc.keywords | Frequent Itemsets | |
dc.keywords | Unstructured P2P network | |
dc.keywords | Convergence of numerical methods | |
dc.keywords | Distributed computer systems | |
dc.keywords | Information science | |
dc.keywords | Peer to peer networks | |
dc.language | English | |
dc.publisher | Springer Nature | |
dc.source | Lecture Notes in Electrical Engineering | |
dc.subject | Computer engineering | |
dc.title | ProFID: practical frequent item set discovery in peer-to-peer networks | |
dc.type | Conference proceeding | |
dspace.entity.type | Publication | |
local.contributor.authorid | 0000-0003-4343-0986 | |
local.contributor.authorid | N/A | |
local.contributor.kuauthor | Özkasap, Öznur | |
local.contributor.kuauthor | Çem, Emrah | |
relation.isOrgUnitOfPublication | 89352e43-bf09-4ef4-82f6-6f9d0174ebae | |
relation.isOrgUnitOfPublication.latestForDiscovery | 89352e43-bf09-4ef4-82f6-6f9d0174ebae |