Abstract
The Agent-Community-based Peer-to-Peer Information Retrieval (ACP2P) method[1],[2] uses agent communities to manage and look up information of interest to users. An agent works as a delegate of its user and searches for information that the user wants by communicating with other agents. The communication between agents is carried out in a peer-to-peer computing architecture. Retrieving information relevant to a user query is performed with content files which consist of original and retrieved documents, and two histories: a query/retrieved document history and a query/sender agent history. The ACP2P is implemented using the Multi-Agent Kodama framework. In this paper, we present some mathematical aspects of the ACP2P method with respect to the relationships between communication loads and the number of records that are stored both in the two histories and retrieved document content files, and discuss the experimental results, for which illustrate the validity of this approach. The results confirm the mathematical conjectures we presented and show that the two histories are more useful for reducing the communication load than a naive method employing 'multicast' techniques, and lead to a higher retrieval accuracy than the naive method.
| Original language | English |
|---|---|
| Title of host publication | Agents and Peer-to-Peer Computing - 4th International Workshop, AP2PC 2005, Revised Papers |
| Pages | 145-158 |
| Number of pages | 14 |
| DOIs | |
| Publication status | Published - Dec 1 2006 |
| Event | 4th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2005 - Utrecht, Netherlands Duration: Jul 25 2005 → Jul 25 2005 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4118 LNAI |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 4th International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2005 |
|---|---|
| Country | Netherlands |
| City | Utrecht |
| Period | 7/25/05 → 7/25/05 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
ACP2P : Agent-community-based peer-to-peer information retrieval - An evaluation. / Mine, Tsunenori; Kogo, Akihiro; Amamiya, Makoto.
Agents and Peer-to-Peer Computing - 4th International Workshop, AP2PC 2005, Revised Papers. 2006. p. 145-158 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4118 LNAI).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - ACP2P
T2 - Agent-community-based peer-to-peer information retrieval - An evaluation
AU - Mine, Tsunenori
AU - Kogo, Akihiro
AU - Amamiya, Makoto
PY - 2006/12/1
Y1 - 2006/12/1
N2 - The Agent-Community-based Peer-to-Peer Information Retrieval (ACP2P) method[1],[2] uses agent communities to manage and look up information of interest to users. An agent works as a delegate of its user and searches for information that the user wants by communicating with other agents. The communication between agents is carried out in a peer-to-peer computing architecture. Retrieving information relevant to a user query is performed with content files which consist of original and retrieved documents, and two histories: a query/retrieved document history and a query/sender agent history. The ACP2P is implemented using the Multi-Agent Kodama framework. In this paper, we present some mathematical aspects of the ACP2P method with respect to the relationships between communication loads and the number of records that are stored both in the two histories and retrieved document content files, and discuss the experimental results, for which illustrate the validity of this approach. The results confirm the mathematical conjectures we presented and show that the two histories are more useful for reducing the communication load than a naive method employing 'multicast' techniques, and lead to a higher retrieval accuracy than the naive method.
AB - The Agent-Community-based Peer-to-Peer Information Retrieval (ACP2P) method[1],[2] uses agent communities to manage and look up information of interest to users. An agent works as a delegate of its user and searches for information that the user wants by communicating with other agents. The communication between agents is carried out in a peer-to-peer computing architecture. Retrieving information relevant to a user query is performed with content files which consist of original and retrieved documents, and two histories: a query/retrieved document history and a query/sender agent history. The ACP2P is implemented using the Multi-Agent Kodama framework. In this paper, we present some mathematical aspects of the ACP2P method with respect to the relationships between communication loads and the number of records that are stored both in the two histories and retrieved document content files, and discuss the experimental results, for which illustrate the validity of this approach. The results confirm the mathematical conjectures we presented and show that the two histories are more useful for reducing the communication load than a naive method employing 'multicast' techniques, and lead to a higher retrieval accuracy than the naive method.
UR - http://www.scopus.com/inward/record.url?scp=84884645896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84884645896&partnerID=8YFLogxK
U2 - 10.1007/11925941_12
DO - 10.1007/11925941_12
M3 - Conference contribution
AN - SCOPUS:84884645896
SN - 3540490256
SN - 9783540490258
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 145
EP - 158
BT - Agents and Peer-to-Peer Computing - 4th International Workshop, AP2PC 2005, Revised Papers
ER -