Solving the Attribute Reduction Problem with Ant Colony Optimization

DOI10.1007/978-3-540-88425-5_25zbMath1185.68724OpenAlexW1502577696MaRDI QIDQ5900467

Fakuan Lan, Guo-Yin Wang, Hong Yu

Publication date: 25 November 2008

Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88425-5_25

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Discernibility matrix simplification for constructing attribute reducts
• Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
• Rough sets
• Reduction algorithms based on discernibility matrix: The ordered attributes method

This page was built for publication: Solving the Attribute Reduction Problem with Ant Colony Optimization