Content Aggregation on Knowledge Bases using Graph Clustering


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.

DOI: 10.1007/11762256_39

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Schmitz2006ContentAO, title={Content Aggregation on Knowledge Bases using Graph Clustering}, author={Christoph Schmitz and Andreas Hotho and Robert J{\"a}schke and Gerd Stumme}, booktitle={LWA}, year={2006} }