Extremes in the Complexity of Computing Metric Distances Between Partitions

DOI10.1109/TPAMI.1984.4767476MaRDI QIDQ3313142zbMATH OpenWikidataFDO

Authors Robert S. Wells, W. 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)

Recommendations

• An efficient algorithm for computing the distance between close partitions
• On complexity of some problems of cluster analysis of vector sequences
• The complexity of ultrametric partitions on graphs
• scientific article; zbMATH DE number 1107550
• The metric properties of partitions of arbitrary sets

Cited in

(4)

• Metrics on sets of interval partitions with diversity
• An efficient algorithm for computing the distance between close partitions
• A metric for measurable partitions
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313142)