Ant colony optimization with partial-complete searching for attribute reduction
J. Comput. Science, Volume 25, 2018, Pages 170-182.
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
Full Text (Upload PDF)
PPT (Upload PPT)