@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 = {Proceedings of the 3rd European Semantic Web Conference}, series = {LNCS}, publisher = {Springer}, address = {Budva, Montenegro}, year = {2006}, volume = {4011}, pages = {530-544}, url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006sumarize_eswc.pdf}, isbn = {3-540-34544-2}, keywords = {2006, aggregation, clustering, content, graph, myown, ontology, theory} }

%0 = inproceedings %A = Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd %B = Proceedings of the 3rd European Semantic Web Conference %C = Budva, Montenegro %D = 2006 %I = Springer %T = Content Aggregation on Knowledge Bases using Graph Clustering %U = http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006sumarize_eswc.pdf

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.

@inproceedings{schmitz2006content, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {Content Aggregation on Knowledge Bases using Graph Clustering}, editor = {Sure, York and Domingue, John}, booktitle = {The Semantic Web: Research and Applications}, series = {LNAI}, publisher = {Springer}, address = {Heidelberg}, year = {2006}, volume = {4011}, pages = {530-544}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}, keywords = {2006, aggregation, clustering, content, graph, itegpub, l3s, myown, nepomuk, ontologies, ontology, seminar2006, theory}, 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.} }

%0 = inproceedings %A = Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd %B = The Semantic Web: Research and Applications %C = Heidelberg %D = 2006 %I = Springer %T = Content Aggregation on Knowledge Bases using Graph Clustering %U = http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf

@article{soderberg2002gfi, author = {Soderberg, B.}, title = {General formalism for inhomogeneous random graphs}, journal = {Phys. Rev. E}, publisher = {APS}, year = {2002}, volume = {66}, number = {6}, pages = {066121}, keywords = {graph, k-partite, random, theory} }

%0 = article %A = Soderberg, B. %D = 2002 %I = APS %T = General formalism for inhomogeneous random graphs

@misc{molloy_reed95, author = {Molloy, M. and Reed, B.}, title = {A critical point for random graphs with a given degree sequence}, journal = {Random Structures & Algorithms}, year = {1995}, volume = {6}, pages = {161-179}, url = {/brokenurl#citeseer.ist.psu.edu/molloy95critical.html}, keywords = {component, configuration, giant, graph, model, random, theory} }

%0 = misc %A = Molloy, M. and Reed, B. %D = 1995 %T = A critical point for random graphs with a given degree sequence %U = /brokenurl#citeseer.ist.psu.edu/molloy95critical.html

@article{frank1988rsa, author = {Frank, O.}, title = {Random sampling and social networks: a survey of various approaches}, journal = {Math. Sci. Humaines}, year = {1988}, volume = {104}, pages = {19--33}, keywords = {graph, random, review, sna, theory} }

%0 = article %A = Frank, O. %D = 1988 %T = Random sampling and social networks: a survey of various approaches

@article{karonski1982rrg, author = {Karonski, M.}, title = {A review of random graphs}, journal = {Journal of Graph Theory}, publisher = {Wiley Subscription Services, Inc., A Wiley Company New York}, year = {1982}, volume = {6}, number = {4}, keywords = {graph, random, theory} }

%0 = article %A = Karonski, M. %D = 1982 %I = Wiley Subscription Services, Inc., A Wiley Company New York %T = A review of random graphs