%0 Conference Paper %1 schmitz2006content %A Schmitz, Christoph %A Hotho, Andreas %A Jäschke, Robert %A Stumme, Gerd %B The Semantic Web: Research and Applications %C Berlin/Heidelberg %D 2006 %E Sure, York %E Domingue, John %I Springer %K 2006 aggregation clustering graph iccs_example knowledge l3s myown trias_example %P 530--544 %R 10.1007/11762256_39 %T Content Aggregation on Knowledge Bases using Graph Clustering %U http://www.springerlink.com/content/u121v1827v286398/ %V 4011 %X 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. %@ 978-3-540-34544-2

@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.}, added-at = {2009-05-25T18:35:12.000+0200}, address = {Berlin/Heidelberg}, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, biburl = {https://www.bibsonomy.org/bibtex/21788c88e04112a4491f19dfffb8dc39e/jaeschke}, booktitle = {The Semantic Web: Research and Applications}, doi = {10.1007/11762256_39}, editor = {Sure, York and Domingue, John}, interhash = {d2ddbb8f90cd271dc18670e4c940ccfb}, intrahash = {1788c88e04112a4491f19dfffb8dc39e}, isbn = {978-3-540-34544-2}, issn = {0302-9743}, keywords = {2006 aggregation clustering graph iccs_example knowledge l3s myown trias_example}, month = jun, pages = {530--544}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2014-07-28T15:57:31.000+0200}, title = {Content Aggregation on Knowledge Bases using Graph Clustering}, url = {http://www.springerlink.com/content/u121v1827v286398/}, volume = 4011, year = 2006 }