Near-optimal feature selection for large databases

DOI10.1057/PALGRAVE.JORS.2602651MaRDI QIDQ3394094zbMATH OpenOpenAlexFDO

Authors

Publication date 28 August 2009

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602651

zbMATH Keywords

feature selectiondata miningcombinatorial optimizationscalability

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Optimization-based feature selection with adaptive instance sampling
• scientific article; zbMATH DE number 1691504
• Quadratic programming feature selection
• Two-stage nested partitions method for stochastic optimization
• Optimum feature selection by zero-one integer programming

Cited in

(3)

• scientific article; zbMATH DE number 6378115 (Why is no real title available?)
• Using simulated annealing to optimize the feature selection problem in marketing applications
• Efficient selection of feature sets possessing high coefficients of determination based on incremental determinations

Describes a project that uses

Uses Software

• DistAl

This page was built for publication: Near-optimal feature selection for large databases

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