Ant colony optimization with partial-complete searching for attribute reduction

Zhi-Heng Zhang
Zhi-Heng Zhang
Ji Dong
Ji Dong

J. Comput. Science, Volume 25, 2018, Pages 170-182.

Cited by: 1|Bibtex|Views2|Links
EI

Abstract:

Abstract The time-cost-sensitive attribute reduction problem is more challenging than the classical reduct problem since the optimal solution is sparser. Ant colony optimization (ACO) is an effective approach to this problem. However, the efficiency is unsatisfactory since each ant needs to search for a complete solution. In this paper,...More

Code:

Data:

Your rating :
0

 

Tags
Comments