@inproceedings{schmitz2006content, abstract = {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.}, address = {Heidelberg}, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, booktitle = {The Semantic Web: Research and Applications}, editor = {Sure, York and Domingue, John}, interhash = {d2ddbb8f90cd271dc18670e4c940ccfb}, intrahash = {1788c88e04112a4491f19dfffb8dc39e}, pages = {530-544}, publisher = {Springer}, series = {LNAI}, title = {Content Aggregation on Knowledge Bases using Graph Clustering}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}, volume = 4011, year = 2006 }