Skip to Main content Skip to Navigation
Journal articles

Totally Balanced Dissimilarities

Abstract : We show in this paper a bijection between totally balanced hy-pergraphs and so called totally balanced dissimilarities. We give an efficient way (O(n 3) where n is the number of elements) to (i) recognize if a given dissimilarity is totally balanced and (ii) approximate it if it is not the case. We also introduce a new kind of dissimilarity which generalize chordal graphs and allows a polynomial number of cluster that can be easily computed and interpreted.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02269391
Contributor : Victor Chepoi <>
Submitted on : Wednesday, May 20, 2020 - 5:19:06 PM
Last modification on : Wednesday, May 27, 2020 - 8:14:33 AM

File

totally balanced dissimilariti...
Files produced by the author(s)

Identifiers

Collections

Citation

François Brucker, Pascal Prea, Célia Châtel. Totally Balanced Dissimilarities. Journal of Classification, Springer Verlag, 2019, ⟨10.1007/s00357-019-09320-w⟩. ⟨hal-02269391⟩

Share

Metrics

Record views

96

Files downloads

59