Zur Kurzanzeige

dc.date.accessioned2009-04-20T09:35:48Z
dc.date.available2009-04-20T09:35:48Z
dc.date.issued2006
dc.identifier.uriurn:nbn:de:hebis:34-2009042027014
dc.identifier.urihttp://hdl.handle.net/123456789/2009042027014
dc.format.extent252842 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.rightsUrheberrechtlich geschützt
dc.rights.urihttps://rightsstatements.org/page/InC/1.0/
dc.subject.ddc004
dc.titleContent aggregation on knowledge bases using graph clusteringeng
dc.typePreprint
dcterms.abstractRecently, 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 proposes the use of graph clustering techniques 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.eng
dcterms.accessRightsopen access
dcterms.creatorSchmitz, Christoph
dcterms.creatorHotho, Andreas
dcterms.creatorJäschke, Robert
dcterms.creatorStumme, Gerd
dc.description.everythingAuch erschienen in: Sure, York u.a. (Hrsg.): The semantic web. (Lecture notes in computer science ; 4011). Berlin u.a. : Springer, 2006. S. 530-544. ISBN 3-540-34544-2 = 978-3-540-34544-2 (The original publication is available at www.springerlink.com)ger
dc.subject.swdWissensextraktionger
dc.subject.swdWissensmanagementger
dc.subject.swdOntologie <Wissensverarbeitung>ger


Dateien zu dieser Ressource

Thumbnail

Das Dokument erscheint in:

Zur Kurzanzeige