Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
