Query-based learning method for query routing in unstructured P2P systems
I tiakina i:
| I whakaputaina i: | Proceedings on the International Conference on Artificial Intelligence (ICAI) (2019), p. 373 |
|---|---|
| Kaituhi matua: | |
| I whakaputaina: |
The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp)
|
| Ngā marau: | |
| Urunga tuihono: | Citation/Abstract Full Text Full Text - PDF |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
| Whakarāpopotonga: | P2P systems allow users to share and access different resources over Internet. Actually, they are an excellent alternative to client/server ones, since they are fault tolerant and more scalable. Nonetheless, searching pertinent peers (i.e., peers which share pertinent resources) to user queries in large scale P2P systems is a major problem. In the literature, this task is commonly named query routing. In this respect, the author introduces in this paper a new query-based routing method for unstructured P2P systems. The main originality of our method is the exploitation of the strong connections between query terms and relevant peers, which provided pertinent results for those queries, to define a user profile model. Thus, the computation of the user profile comes down to extracting special types of triadic formal concepts. The user profile is used latter to efficiently route the forthcoming queries. Simulation results show that our method is more effective than the baseline method. |
|---|---|
| Puna: | Advanced Technologies & Aerospace Database |