Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.: Content Aggregation on Knowledge Bases using Graph Clustering.
Proceedings of the 3rd European Semantic Web Conference. Budva, Montenegro: Springer, 2006 (LNCS 4011), S. 530-544
[Volltext]
[BibTeX]
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.: Content Aggregation on Knowledge Bases using Graph Clustering. In: Sure, Y. & Domingue, J. (Hrsg.):
The Semantic Web: Research and Applications. Heidelberg: Springer, 2006 (LNAI 4011), S. 530-544
[Volltext] [Kurzfassung]
[BibTeX]
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.
Soderberg, B.: General formalism for inhomogeneous random graphs. In:
Phys. Rev. E 66 (2002), Nr. 6, S. 066121
[BibTeX]
Molloy, M. & Reed, B.:
A critical point for random graphs with a given degree sequence. , 1995
[Volltext]
[BibTeX]
Frank, O.: Random sampling and social networks: a survey of various approaches. In:
Math. Sci. Humaines 104 (1988), S. 19-33
[BibTeX]
Karonski, M.: A review of random graphs. In:
Journal of Graph Theory 6 (1982), Nr. 4,
[BibTeX]