Journal
2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
Volume -, Issue -, Pages 1794-1800Publisher
IEEE
DOI: 10.1109/CEC.2018.8477643
Keywords
-
Ask authors/readers for more resources
In this paper we introduce a new algorithm, called Ant-Miner-Reg(MA) to tackle the regression problem using an archive-based pheromone model. Existing regression algorithms handle continuous attribute using a discretisation procedure, either in a preprocessing stage or during rule creation. Using an archive as a pheromone model, inspired by the ACO for Mixed-Variable (ACOMV), we eliminate the need for a discretisation procedure. We compare the proposed Ant-Miner-Reg(MA) against Ant-Miner-Reg, an ACO-based regression algorithm that uses a dynamic discretisation procedure, inspired on M5 algorithm, during rule construction process. Our results show that Ant-Miner-Reg(MA) achieved a significant improvement in the relative root mean square error of the models created, overcoming the limitations of the dynamic discretisation procedure.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available