Dendrograms, minimum spanning trees and feature selection

DOI10.1016/j.ejor.2022.11.031MaRDI QIDQ6167525

Mercedes Landete, Marina Leal, Martine Labbé

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationhierarchical clusteringminimum spanning treefeature selectionsingle linkage

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The longest path problem has a polynomial solution on interval graphs
• On approximating the longest path in a graph
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Using separation algorithms to generate mixed integer model reformulations
• Cluster analysis and mathematical programming
• Simultaneous feature selection and clustering based on square root optimization
• A novel embedded min-max approach for feature selection in nonlinear support vector machine classification
• A new separation algorithm for the Boolean quadric and cut polytopes
• Variable selection for Naïve Bayes classification
• A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach
• Combining clustering of variables and feature selection using random forests
• A Framework for Feature Selection in Clustering
• Algorithms and Computation