QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. Content Aggregation on Knowledge Bases using Graph Clustering 2006
    Vol. 4011The Semantic Web: Research and Applications, pp. 530-544 
    inproceedings URL 
    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.
    BibTeX:
    @inproceedings{schmitz2006content,
      author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
      title = {Content Aggregation on Knowledge Bases using Graph Clustering},
      booktitle = {The Semantic Web: Research and Applications},
      publisher = {Springer},
      year = {2006},
      volume = {4011},
      pages = {530-544},
      url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}
    }
    
    Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. Content Aggregation on Knowledge Bases using Graph Clustering 2006
    Vol. 4011The Semantic Web: Research and Applications, pp. 530-544 
    inproceedings URL 
    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.

    BibTeX:
    @inproceedings{schmitz2006content,
      author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
      title = {Content Aggregation on Knowledge Bases using Graph Clustering},
      booktitle = {The Semantic Web: Research and Applications},
      publisher = {Springer},
      year = {2006},
      volume = {4011},
      pages = {530-544},
      url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}
    }
    

    Created by JabRef on 18/09/2020.