Adaptive divide and conquer algorithm for cost-sensitive attribute reduction

DOI10.6040/J.ISSN.1671-9352.0.2015.435MaRDI QIDQ2984700zbMATH OpenFDO

Authors Wei-Ting Huang, Hong Zhao, William Zhu

Publication date 17 May 2017

Full work available at URL https://doi.org/10.6040/J.ISSN.1671-9352.0.2015.435

zbMATH Keywords

adaptive divide and conquerattribute reductioncost-sensitivegranular computingrough sets

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• Local view based cost-sensitive attribute reduction
• A set-cover-based approach for the test-cost-sensitive attribute reduction problem
• Cost-sensitive rough set approach
• Cost-sensitive approximate attribute reduction with three-way decisions

Cited in

(2)

• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• Divide and conquer algorithm for minimal cost feature selection with measurement error

This page was built for publication: Adaptive divide and conquer algorithm for cost-sensitive attribute reduction

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