Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D. (2007), On Finding Graph Clusterings with Maximum Modularity, in Andreas Brandstädt; Dieter Kratsch & Haiko Müller, ed., 'Graph-Theoretic Concepts in Computer Science' , Springer, Berlin / Heidelberg , pp. 121-132 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.

Newman, M. (2006), 'Finding community structure in networks using the eigenvectors of matrices', Physical Review E 74 (3) , 36104 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006), Content Aggregation on Knowledge Bases using Graph Clustering, in York Sure & John Domingue, ed., 'The Semantic Web: Research and Applications' , Springer, Heidelberg , pp. 530-544 .
[Volltext] [Kurzfassung] [BibTeX] [Endnote]

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.

2007

2006

2005

1997