Details
Original language | English |
---|---|
Title of host publication | The Semantic Web, ISWC 2005 |
Subtitle of host publication | 4th International Semantic Web Conference, ISWC 2005, Proceedings |
Publisher | Springer Verlag |
Pages | 491-505 |
Number of pages | 15 |
ISBN (electronic) | 978-3-540-32082-1 |
ISBN (print) | 978-3-540-29754-3 |
Publication status | Published - 2005 |
Event | 4th International Semantic Web Conference, ISWC 2005 - Galway, Ireland Duration: 6 Nov 2005 → 10 Nov 2005 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 3729 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (electronic) | 1611-3349 |
Abstract
Often the challenge of finding relevant information is reduced to find the 'right' people who will answer our question. In this paper we present innovative algorithms called INGA (Interest-based Node Grouping Algorithms) which integrate personal routing indices into semantic query processing to boost performance. Similar to social networks peers in INGA cooperate to efficiently route queries for documents along adaptive shortcut-based overlays using only local, but semantically well chosen information. We propose active and passive shortcut creation strategies for index building and a novel algorithm to select the most promising content providers depending on each peer index with respect to the individual query. We quantify the benefit of our indexing strategy by extensive performance experiments in the SWAP simulation infrastructure. While obtaining high recall values compared to other state-of-the-art algorithms, we show that INGA improves recall and reduces the number of messages significantly.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
The Semantic Web, ISWC 2005: 4th International Semantic Web Conference, ISWC 2005, Proceedings. Springer Verlag, 2005. p. 491-505 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3729 LNCS).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Searching dynamic communities with personal indexes
AU - Löser, Alexander
AU - Tempich, Christoph
AU - Quilitz, Bastian
AU - Balke, Wolf Tilo
AU - Staab, Steffen
AU - Nejdl, Wolfgang
PY - 2005
Y1 - 2005
N2 - Often the challenge of finding relevant information is reduced to find the 'right' people who will answer our question. In this paper we present innovative algorithms called INGA (Interest-based Node Grouping Algorithms) which integrate personal routing indices into semantic query processing to boost performance. Similar to social networks peers in INGA cooperate to efficiently route queries for documents along adaptive shortcut-based overlays using only local, but semantically well chosen information. We propose active and passive shortcut creation strategies for index building and a novel algorithm to select the most promising content providers depending on each peer index with respect to the individual query. We quantify the benefit of our indexing strategy by extensive performance experiments in the SWAP simulation infrastructure. While obtaining high recall values compared to other state-of-the-art algorithms, we show that INGA improves recall and reduces the number of messages significantly.
AB - Often the challenge of finding relevant information is reduced to find the 'right' people who will answer our question. In this paper we present innovative algorithms called INGA (Interest-based Node Grouping Algorithms) which integrate personal routing indices into semantic query processing to boost performance. Similar to social networks peers in INGA cooperate to efficiently route queries for documents along adaptive shortcut-based overlays using only local, but semantically well chosen information. We propose active and passive shortcut creation strategies for index building and a novel algorithm to select the most promising content providers depending on each peer index with respect to the individual query. We quantify the benefit of our indexing strategy by extensive performance experiments in the SWAP simulation infrastructure. While obtaining high recall values compared to other state-of-the-art algorithms, we show that INGA improves recall and reduces the number of messages significantly.
UR - http://www.scopus.com/inward/record.url?scp=33646417609&partnerID=8YFLogxK
U2 - 10.1007/11574620_36
DO - 10.1007/11574620_36
M3 - Conference contribution
AN - SCOPUS:33646417609
SN - 978-3-540-29754-3
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 491
EP - 505
BT - The Semantic Web, ISWC 2005
PB - Springer Verlag
T2 - 4th International Semantic Web Conference, ISWC 2005
Y2 - 6 November 2005 through 10 November 2005
ER -