Efficient feature selection for logical analysis of large-scale multi-class datasets
From MaRDI portal
Publication:2045033
DOI10.1007/s10878-021-00732-2zbMath1473.90147OpenAlexW3143026846MaRDI QIDQ2045033
Kedong Yan, Dongjing Miao, Cui Guo, Chanying Huang
Publication date: 11 August 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00732-2
Uses Software
Cites Work
- Unnamed Item
- Compact MILP models for optimal and Pareto-optimal LAD patterns
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
- MILP approach to pattern generation in logical analysis of data
- A Lagrangian-based heuristic for large-scale set covering problems
- Logical analysis of numerical data
- Strong valid inequalities for Boolean logical pattern generation
- Coronary risk prediction by logical analysis of data
- Functional dependency restricted insertion propagation
- Logical analysis of multiclass data with relaxed patterns
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation
- Logical analysis of data -- the vision of Peter L. Hammer
- Maximum patterns in datasets
- Reformulation of the support set selection problem in the logical analysis of data
- A LAD-based method for selecting short oligo probes for genotyping applications
- Spanned patterns for the logical analysis of data
- Accelerated algorithm for pattern detection in logical analysis of data
- Subset-conjunctive rules for breast cancer diagnosis
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A Greedy Heuristic for the Set-Covering Problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Heuristic Method for the Set Covering Problem
- Optimization of Complex Systems: Theory, Models, Algorithms and Applications
- A Heuristic Method for Selecting Support Features from Large Datasets
