Dendrograms, minimum spanning trees and feature selection

DOI10.1016/J.EJOR.2022.11.031MaRDI QIDQ6167525zbMATH OpenFDO

Authors Martine Labbé, Mercedes Landete, Marina Leal

Publication date 10 July 2023

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.11.031

zbMATH Keywords

combinatorial optimizationfeature selectionhierarchical clusteringminimum spanning treesingle linkage

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

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

Cited in

(4)

• Feature minimization within decision trees
• Basic theory of feature trees
• Feature and functional form selection in additive models via mixed-integer optimization
• Mixed-integer models for complete-linkage clustering

This page was built for publication: Dendrograms, minimum spanning trees and feature selection

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