@inproceedings{hoser2006semantic,
  abstract = {A key argument for modeling knowledge in ontologies is the easy
re-use and re-engineering of the knowledge. However, beside
consistency checking, current ontology engineering tools provide
only basic functionalities for analyzing ontologies. Since
ontologies can be considered as (labeled, directed) graphs, graph
analysis techniques are a suitable answer for this need. Graph
analysis has been performed by sociologists for over 60 years, and
resulted in the vivid research area of Social Network Analysis
(SNA). While social network structures in general currently receive
high attention in the Semantic Web community, there are only very
few SNA applications up to now, and virtually none for analyzing the
structure of ontologies.

We illustrate in this paper the benefits of applying SNA to
ontologies and the Semantic Web, and discuss which research topics
arise on the edge between the two areas. In particular, we discuss
how different notions of centrality describe the core content and
structure of an ontology. From the rather simple notion of degree
centrality over betweenness centrality to the more complex
eigenvector centrality based on Hermitian matrices, we illustrate
the insights these measures provide on two ontologies, which are
different in purpose, scope, and size.},
  address = {Heidelberg},
  author = {Hoser, Bettina and Hotho, Andreas and Jäschke, Robert and Schmitz, Christoph and Stumme, Gerd},
  booktitle = {The Semantic Web: Research and Applications},
  editor = {Sure, York and Domingue, John},
  interhash = {344ec3b4ee8af1a2c6b86efc14917fa9},
  intrahash = {c0cdbeab23ce0fc1bff5e02c99aab012},
  month = {June},
  pages = {514-529},
  publisher = {Springer},
  series = {LNAI},
  title = {Semantic Network Analysis of Ontologies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/hoser2006semantic.pdf},
  volume = 4011,
  year = 2006
}

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