For resolving attibute reduction of the NP-hard problems effectively, a new complete and efficient Attribute Reduction Algorithm of Rough Set Based on Information Entropy and Ant Colony Algorithm is proposed. After computiing a core of the database by the algorithm of Rough Set and Information Entropy, find the other attibutes in the least reduction of attributes set by the proposed method. Experiments show that the proposed method can get not only the least reduction of complete and incomplete attributes set efficiently and effectively but also more least reductions. The proposed method is of profoud theoretical and pratical significance.
展开▼
