Totally Balanced Dissimilarities

被引:0
|
作者
François Brucker
Pascal Préa
Célia Châtel
机构
[1] LIf,École Centrale Marseille
[2] CNRS UMR 7279,undefined
来源
Journal of Classification | 2020年 / 37卷
关键词
Dissimilarities; Totally balanced hypergraphs; Binary matrices;
D O I
暂无
中图分类号
学科分类号
摘要
We show in this paper a bijection between totally balanced hypergraphs and so-called totally balanced dissimilarities. We give an efficient way (O(n3) 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 generalizes chordal graphs and allows a polynomial number of clusters that can be easily computed and interpreted.
引用
收藏
页码:203 / 222
页数:19
相关论文
共 50 条