A note on clustering aggregation for binary clusterings

DOI10.1016/j.orl.2023.11.005MaRDI QIDQ6556150

Jiehua Chen, Danny Hermelin, Manuel Sorge

Publication date: 17 June 2024

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

parameterized algorithmsmedian procedureaggregation of binary stringsmirkin distance minimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong partial clones and the time complexity of SAT problems
• On the computation of median linear orders, of median complete preorders and of median weak orders
• The median procedure in cluster analysis and social choice theory
• Which problems have strongly exponential complexity?
• Ensemble-based community detection in multilayer networks
• Cluster ensembles: a survey of approaches with recent extensions and applications
• On the parameterized complexity of consensus clustering
• Comparing clusterings -- an information based distance
• Mathematical classification and clustering
• 10.1162/153244303321897735

This page was built for publication: A note on clustering aggregation for binary clusterings