Skip to Main content Skip to Navigation
Conference papers

Modularity clustering on trees

Abstract : Network (or graphs) are often used to represent complex systems in a variety of fields. Tipically, the set of vertices of the graph corresponds to the set of entities under study and the edges represent relations holding for pairs of vertices. The analysis of networks is so gaining more and more attention, specially the analysis devoted to the detection of clusters, or communities. Clusters correspond in fact to subgroups of entities among which strong relations exist. In this paper we are particularly interested in clustering problems in which the underlying graph is a tree T = (V,E). Trees are undirected graphs in which any two vertices are connected by exactly one simple path. Clustering on trees [3] arises in a variety of applications, such as phylogenetic analysis in biological classification and the analysis of communication or distribution networks which exibit a tree-like structure.
Document type :
Conference papers
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal-enac.archives-ouvertes.fr/hal-00934806
Contributor : Laurence Porte <>
Submitted on : Tuesday, April 8, 2014 - 3:56:51 PM
Last modification on : Tuesday, October 20, 2020 - 10:32:04 AM
Long-term archiving on: : Tuesday, July 8, 2014 - 10:44:04 AM

File

445.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00934806, version 1

Collections

Citation

Sonia Cafieri, Pierre Hansen. Modularity clustering on trees. ROADEF 2012, 13ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Apr 2012, Angers, France. ⟨hal-00934806⟩

Share

Metrics

Record views

375

Files downloads

114