A hierarchical clustering algorithm based on the Hungarian method
Pattern Recognition Letters
Hi-index | 0.00 |
Inheritance, Retention, Variance Hierarchical Clustering, based on Tree-Structured Stick Breaking for Hierarchical Data method which uses nested stick-breaking processes to allow for trees of unbounded width and depth, is proposed. The stress is put on the three requirements, the important one is that groups located lower in the hierarchy are more specific. The paper contains description of the method and experimental comparison of both methods.