Abstract: Reduction in rough set theory is a typical NP-hard problem. A new algorithm for relative reduction which is based on Subset ant colony algorithm was proposed. By using the strategy of diversion probability, every attribute is randomly searched by ants unt

Key words: Rough set, Subset ant colony algorithm, Reduction, Pheromone mutation