A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Heuristic Approaches for the Quartet Method of Hierarchical Clustering
2010
IEEE Transactions on Knowledge and Data Engineering
Given a set of objects and their pairwise distances, we wish to determine a visual representation of the data. We use the quartet paradigm to compute a hierarchy of clusters of the objects. The method is based on an NP-hard graph optimization problem called the Minimum Quartet Tree Cost problem. This paper presents and compares several metaheuristic approaches to approximate the optimal hierarchy. The performance of the algorithms is tested through extensive computational experiments and it is
doi:10.1109/tkde.2009.188
fatcat:sdlzh2i2jnaslmtr6oedy3j4a4