Extremes in the Complexity of Computing Metric Distances Between Partitions

DOI10.1109/TPAMI.1984.4767476zbMath0531.62058WikidataQ84832538 ScholiaQ84832538MaRDI QIDQ3313142

Robert S. Wells, William H. E. Day

Publication date: 1984

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

zbMATH Keywords

NP-complete problemspartitions of setscomplexity of algorithmscomparison of nonhierarchic classificationsmetric measures of distanceminimum-length sequence metrics

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

On the use of ordered sets in problems of comparison and consensus of classifications

This page was built for publication: Extremes in the Complexity of Computing Metric Distances Between Partitions