A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Handling continuous attributes in Ant Colony Classification algorithms
2009
2009 IEEE Symposium on Computational Intelligence and Data Mining
Most real-world classification problems involve continuous (real-valued) attributes, as well as, nominal (discrete) attributes. The majority of Ant Colony Optimisation (ACO) classification algorithms have the limitation of only being able to cope with nominal attributes directly. Extending the approach for coping with continuous attributes presented by cAnt-Miner (Ant-Miner coping with continuous attributes), in this paper we propose two new methods for handling continuous attributes in ACO
doi:10.1109/cidm.2009.4938653
dblp:conf/cidm/OteroFJ09
fatcat:f3vi6z4kznf5vhulnm7mjg56om