arXiv Open Access 2015

Relations Between Adjacency and Modularity Graph Partitioning

Hansi Jiang Carl Meyer

Lihat Sumber

Abstrak

This paper develops the exact linear relationship between the leading eigenvector of the unnormalized modularity matrix and the eigenvectors of the adjacency matrix. We propose a method for approximating the leading eigenvector of the modularity matrix, and we derive the error of the approximation. There is also a complete proof of the equivalence between normalized adjacency clustering and normalized modularity clustering. Numerical experiments show that normalized adjacency clustering can be as twice efficient as normalized modularity clustering.

Topik & Kata Kunci

stat.ML

Penulis (2)

Hansi Jiang

Carl Meyer

Format Sitasi

APA MLA BibTeX

Jiang, H., Meyer, C. (2015). Relations Between Adjacency and Modularity Graph Partitioning. https://arxiv.org/abs/1505.03481

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓