BibSonomyburst/user/stumme/aggregationBibSonomy RSS feed for /user/stumme/aggregation2012-02-16T23:14:44+01:00http://www.bibsonomy.org/bibtex/21788c88e04112a4491f19dfffb8dc39e/stummestumme2006-09-20T18:23:30+02:002006 aggregation clustering content graph itegpub l3s myown nepomuk ontologies ontology seminar2006 theory <span class="authorEditorList"><a href="/author/Schmitz">Christoph Schmitz</a>, <a href="/author/Hotho">Andreas Hotho</a>, <a href="/author/Jäschke">Robert Jäschke</a>, and <a href="/author/Stumme">Gerd Stumme</a> </span><em>The Semantic Web: Research and Applications, </em><em>volume 4011 of LNAI, </em><em>page 530-544. </em><em>Heidelberg, </em><em>Springer, </em>(<em>2006</em>)Wed Sep 20 18:23:30 CEST 2006HeidelbergThe Semantic Web: Research and Applications530-544LNAIContent Aggregation on Knowledge Bases using Graph Clustering401120062006 aggregation clustering content graph itegpub l3s myown nepomuk ontologies ontology seminar2006 theory 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 provides a graph clustering technique 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.