On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts

DOI10.1016/j.ins.2019.05.041zbMath1451.68224OpenAlexW2945258978MaRDI QIDQ2215062

Marek Grzegorowski, Dominik Ślęzak

Publication date: 10 December 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.05.041

zbMATH Keywords

heuristic searchNP-hardnessmultivariate feature selectionresilient feature selectionrough-set-based approximate reducts

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Label distribution feature selection for multi-label classification with rough set ⋮ A novel variable precision rough set attribute reduction algorithm based on local attribute significance ⋮ Heuristic-based feature selection for rough set approach ⋮ Distributed approach for computing rough set approximations of big incomplete information systems ⋮ Ensemble learning based on approximate reducts and bootstrap sampling ⋮ A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique

Uses Software

• Learn++.MF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximations and uncertainty measures in incomplete information systems
• Consistency-based search in feature selection
• Rudiments of rough sets
• Learn\(^{++}\).MF: A random subspace approach for the missing feature problem
• Feature selection with test cost constraint
• Decision bireducts and decision reducts -- a comparison
• Local ratio method on partial set multi-cover
• Parallelizing feature selection
• Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts
• Exact Algorithms for Set Multicover and Multiset Multicover Problems
• On Reduct Construction Algorithms

This page was built for publication: On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts