Partitions optimisées selon différents critères : évaluation et comparaison
In this article, we study and compare partitionning methods applied to a distance matrix. Given the maximum number of classes and a criterion, we build one partition optimizing this criterion for each number of classes varying from 2 to this maximum. All the studied criteria lead to NP-hard problems...
Gespeichert in:
| Veröffentlicht in: | URI:https://journals.openedition.org/msh, |
|---|---|
| 1. Verfasser: | |
| Format: | Article ou chapitre numérique |
| Sprache: | Français |
| Veröffentlicht: |
Mathématiques et sciences humaines
2006
|
| Schlagworte: | |
| Online Zugang: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |
| Zusammenfassung: | In this article, we study and compare partitionning methods applied to a distance matrix. Given the maximum number of classes and a criterion, we build one partition optimizing this criterion for each number of classes varying from 2 to this maximum. All the studied criteria lead to NP-hard problems. The general algorithm combines optimization and metaheuristic technics to build sub-optimal solutions. Several ways to evaluate the quality of the classes and to compare partitions corresponding to different criteria are proposed. They allow to chose the best partition fitting a distance matrix and, simulating several types of metric, to designate the criterion providing generally the best results. |
|---|