1 resultado para graph matching algorithms
em Universitätsbibliothek Kassel, Universität Kassel, Germany
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (6)
- Adam Mickiewicz University Repository (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (14)
- Aston University Research Archive (8)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Câmara dos Deputados (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (3)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (3)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (16)
- Boston University Digital Common (20)
- Brock University, Canada (8)
- Bulgarian Digital Mathematics Library at IMI-BAS (4)
- CaltechTHESIS (11)
- Cambridge University Engineering Department Publications Database (160)
- CentAUR: Central Archive University of Reading - UK (4)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (52)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Deakin Research Online - Australia (21)
- Department of Computer Science E-Repository - King's College London, Strand, London (19)
- Digital Commons - Michigan Tech (3)
- Digital Commons at Florida International University (1)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (4)
- Greenwich Academic Literature Archive - UK (15)
- Helda - Digital Repository of University of Helsinki (35)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (250)
- Instituto Politécnico de Leiria (1)
- Instituto Politécnico do Porto, Portugal (2)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (14)
- Nottingham eTheses (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (6)
- Queensland University of Technology - ePrints Archive (236)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional da Universidade de Brasília (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (10)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (2)
- Universidad Politécnica de Madrid (4)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universita di Parma (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- University of Michigan (6)
- University of Queensland eSpace - Australia (2)
- University of Southampton, United Kingdom (1)
- University of Washington (2)
Resumo:
Recently, research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which are targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary to obtain provide brief semantic descriptions of peers, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peers a given query should be forwarded. This paper proposes the use of graph clustering techniques on knowledge bases for that purpose. Using this clustering, we can show that our strategy requires up to 58% fewer queries than the baselines to yield full recall in a bibliographic P2PKM scenario.