Heuristic-based feature selection for rough set approach
From MaRDI portal
Publication:2206454
DOI10.1016/j.ijar.2020.07.005zbMath1490.68231OpenAlexW3047406704MaRDI QIDQ2206454
Publication date: 22 October 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2020.07.005
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (4)
Fast attribute reduction via inconsistent equivalence classes for large-scale data ⋮ Measurement, modeling, reduction of decision-theoretic multigranulation fuzzy rough sets based on three-way decisions ⋮ Editorial. Formal concept analysis, rough sets, and three-way decisions ⋮ Pointwise mutual information sparsely embedded feature selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incremental attribute reduction approach based on knowledge granularity under the attribute generalization
- Quick general reduction algorithms for inconsistent decision tables
- Combinatorial machine learning. A rough set approach.
- Feature extraction. Foundations and applications. Papers from NIPS 2003 workshop on feature extraction, Whistler, BC, Canada, December 11--13, 2003. With CD-ROM.
- Rudiments of rough sets
- Rough sets and Boolean reasoning
- Wrappers for feature subset selection
- Modeling by shortest data description
- Feature selection using rough set-based direct dependency calculation by avoiding the positive region
- Feature selection based on composition of rough sets induced by feature granulation
- Rough sets and intelligent data analysis
- Attribute reduction based on \(k\)-nearest neighborhood rough sets
- Fuzzy rough set based incremental attribute reduction from dynamic data with sample arriving
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
- Optimal granule level selection: a granule description accuracy viewpoint
- Three-way granular computing, rough sets, and formal concept analysis
- Discernibility matrix based incremental feature selection on fused decision tables
- Maximum patterns in datasets
- Dynamic programming approach to optimization of approximate decision rules
- A threshold of ln n for approximating set cover
- Application of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length
- 10.1162/153244303322753616
- Comparison of Heuristics for Optimization of Association Rules
- Relationships Between Length and Coverage of Decision Rules
- Computational Methods of Feature Selection
- Approximate Boolean Reasoning: Foundations and Applications in Data Mining
- Machine Learning: ECML 2004
- Transactions on Rough Sets III
This page was built for publication: Heuristic-based feature selection for rough set approach
