Towards Content Aggregation on Knowledge Bases through Graph Clustering
C. Schmitz. 17. Workshop "Grundlagen von Datenbanken", (May 2005)
Abstract
Recently, several research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which have been targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary for participants to provide brief descriptions of themselves, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peer a given query should be forwarded. In this talk, I propose the use of graph clustering techniques on knowledge bases for that purpose. After a brief round-trip over an ontology-based P2P knowledge management scenario, I will demonstrate the automatic generation of self-descriptions of peers’ knowledge bases through the use of graph clustering. Viewing the knowledge base of a peer as a graph consisting of concepts and instances, one can employ clustering techniques to partition it into clusters of similar entities. From each cluster, the centroid can then be selected as a re presentative. This yields a list of entities giving an aggregated self description of the peer.
%0 Conference Paper
%1 schmitz05
%A Schmitz, Christoph
%B 17. Workshop "Grundlagen von Datenbanken"
%D 2005
%K prolearn
%T Towards Content Aggregation on Knowledge Bases through Graph Clustering
%U http://dbs.informatik.uni-halle.de/GvD2005/beitraege/gvd05_Schmitz.pdf
%X Recently, several research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which have been targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary for participants to provide brief descriptions of themselves, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peer a given query should be forwarded. In this talk, I propose the use of graph clustering techniques on knowledge bases for that purpose. After a brief round-trip over an ontology-based P2P knowledge management scenario, I will demonstrate the automatic generation of self-descriptions of peers’ knowledge bases through the use of graph clustering. Viewing the knowledge base of a peer as a graph consisting of concepts and instances, one can employ clustering techniques to partition it into clusters of similar entities. From each cluster, the centroid can then be selected as a re presentative. This yields a list of entities giving an aggregated self description of the peer.
@inproceedings{schmitz05,
abstract = {Recently, several research projects such as PADLR and SWAP have developed tools like Edutella or Bibster, which have been targeted at establishing peer-to-peer knowledge management (P2PKM) systems. In such a system, it is necessary for participants to provide brief descriptions of themselves, so that routing algorithms or matchmaking processes can make decisions about which communities peers should belong to, or to which peer a given query should be forwarded. In this talk, I propose the use of graph clustering techniques on knowledge bases for that purpose. After a brief round-trip over an ontology-based P2P knowledge management scenario, I will demonstrate the automatic generation of self-descriptions of peers’ knowledge bases through the use of graph clustering. Viewing the knowledge base of a peer as a graph consisting of concepts and instances, one can employ clustering techniques to partition it into clusters of similar entities. From each cluster, the centroid can then be selected as a re presentative. This yields a list of entities giving an aggregated self description of the peer.},
added-at = {2006-05-31T17:38:26.000+0200},
author = {Schmitz, Christoph},
biburl = {https://www.bibsonomy.org/bibtex/2ada3b798551c7e45a6b5a5ff21da5ee5/prolearn},
booktitle = {17. Workshop "Grundlagen von Datenbanken"},
description = {Prolearn Publication},
interhash = {95fc3f8ac665e99021951ef1aac454cd},
intrahash = {ada3b798551c7e45a6b5a5ff21da5ee5},
keywords = {prolearn},
location = {Wörlitz, Germany},
month = May,
timestamp = {2006-05-31T17:38:26.000+0200},
title = {Towards Content Aggregation on Knowledge Bases through Graph Clustering},
url = {http://dbs.informatik.uni-halle.de/GvD2005/beitraege/gvd05_Schmitz.pdf},
year = 2005
}