Positive macroscopic approximation for fast attribute reduction

DOI10.1155/2013/837281zbMath1267.68215DBLPjournals/jam/LuQJS13OpenAlexW2118038717WikidataQ59004750 ScholiaQ59004750MaRDI QIDQ2375684

Lai-Xiang Shan, Zheng-Cai Lu, Qiao Jing, Zheng Qin

Publication date: 14 June 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/837281

zbMATH Keywords

heuristicssearchattribute reductionmacroscopic approximationpositive macroscopic approximation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
• Reduction of neighborhood-based generalized rough sets
• Consistency-based search in feature selection
• Consistency measure, inclusion degree and fuzzy measure in decision tables
• Positive approximation: an accelerator for attribute reduction in rough set theory
• Exploring the boundary region of tolerance rough sets for feature selection
• Rough computational methods for information systems
• Maximal consistent block technique for rule acquisition in incomplete information systems.
• Mining classification rules using rough sets and neural networks
• An efficient accelerator for attribute reduction from incomplete data in rough set framework
• A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
• COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
• Reducts within the variable precision rough sets model: A further investigation
• Using rough sets with heuristics for feature selection
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive macroscopic approximation for fast attribute reduction