TY  - CONF
AU  - Schmitz, Christoph
AU  - Hotho, Andreas
AU  - Jäschke, Robert
AU  - Stumme, Gerd
A2  - 
T1  - Content Aggregation on Knowledge Bases using Graph Clustering
T2  - Proceedings of the 3rd European Semantic Web Conference
PB  - Springer
C1  - Budva, Montenegro
PY  - 2006/06
CY  -  
VL  - 4011
IS  - 
SP  - 530
EP  - 544
UR  - http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006sumarize_eswc.pdf
DO  - 
KW  - 2006
KW  - aggregation
KW  - clustering
KW  - content
KW  - graph
KW  - myown
KW  - ontology
KW  - theory
L1  - 
SN  - 3-540-34544-2
N1  - 
N1  - 
AB  - 
ER  -

TY  - CONF
AU  - Schmitz, Christoph
AU  - Hotho, Andreas
AU  - Jäschke, Robert
AU  - Stumme, Gerd
A2  - Sure, York
A2  - Domingue, John
T1  - Content Aggregation on Knowledge Bases using Graph Clustering
T2  - The Semantic Web: Research and Applications
PB  - Springer
C1  - Heidelberg
PY  - 2006/
CY  -  
VL  - 4011
IS  - 
SP  - 530
EP  - 544
UR  - http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf
DO  - 
KW  - 2006
KW  - aggregation
KW  - clustering
KW  - content
KW  - graph
KW  - itegpub
KW  - l3s
KW  - myown
KW  - nepomuk
KW  - ontologies
KW  - ontology
KW  - seminar2006
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - Recently, research projects such as PADLR and SWAP<p>  have developed tools like Edutella or Bibster, which are targeted at<p>  establishing peer-to-peer knowledge management (P2PKM) systems.  In<p>  such a system, it is necessary to obtain provide brief semantic<p>  descriptions of peers, so that routing algorithms or matchmaking<p>  processes can make decisions about which communities peers should<p>  belong to, or to which peers a given query should be forwarded.<p>  This paper provides a graph clustering technique on<p>  knowledge bases for that purpose. Using this clustering, we can show<p>  that our strategy requires up to 58% fewer queries than the<p>  baselines to yield full recall in a bibliographic P2PKM scenario.
ER  -

TY  - JOUR
AU  - Soderberg, B.
T1  - General formalism for inhomogeneous random graphs
JO  - Phys. Rev. E
PY  - 2002/
VL  - 66
IS  - 6
SP  - 
EP  - 
UR  - 
DO  - 
KW  - graph
KW  - k-partite
KW  - random
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - GEN
AU  - Molloy, M.
AU  - Reed, B.
A2  - 
T1  - A critical point for random graphs with a given degree sequence
JO  - Random Structures &amp; Algorithms
PB  - 
C1  - 
PY  - 1995/
VL  - 6
IS  - 
SP  - 161
EP  - 179
UR  - /brokenurl#citeseer.ist.psu.edu/molloy95critical.html
DO  - 
KW  - component
KW  - configuration
KW  - giant
KW  - graph
KW  - model
KW  - random
KW  - theory
L1  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Frank, O.
T1  - Random sampling and social networks: a survey of various approaches
JO  - Math. Sci. Humaines
PY  - 1988/
VL  - 104
IS  - 
SP  - 19
EP  - 33
UR  - 
DO  - 
KW  - graph
KW  - random
KW  - review
KW  - sna
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Karonski, M.
T1  - A review of random graphs
JO  - Journal of Graph Theory
PY  - 1982/
VL  - 6
IS  - 4
SP  - 
EP  - 
UR  - 
DO  - 
KW  - graph
KW  - random
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -