Skip to main content

Discovering Regression Rules with Ant Colony Optimization

Brookhouse, James, Otero, Fernando E.B. (2015) Discovering Regression Rules with Ant Colony Optimization. In: Proceedings of the 2015 Genetic and Evolutionary Conference Companion (GECCO'15 Companion). . pp. 1005-1012. ACM Press (doi:10.1145/2739482.2768450) (KAR id:48689)

PDF Author's Accepted Manuscript
Language: English
Download (222kB) Preview
[thumbnail of brookhouse-gecco2015_preprint.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
Official URL


The majority of Ant Colony Optimization (ACO) algorithms for data mining have dealt with classification or clustering problems. Regression remains an unexplored research area to the best of our knowledge. This paper proposes a new ACO algorithm that generates regression rules for data mining applications. The new algorithm combines components from an existing deterministic (greedy) separate and conquer algorithm—employing the same quality metrics and continuous attribute processing techniques—allowing a comparison of the two. The new algorithm has been shown to decrease the relative root mean square error when compared to the greedy algorithm. Additionally a different approach to handling continuous attributes was investigated showing further improvements were possible.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1145/2739482.2768450
Subjects: Q Science > Q Science (General) > Q335 Artificial intelligence
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Fernando Otero
Date Deposited: 29 May 2015 12:52 UTC
Last Modified: 16 Feb 2021 13:25 UTC
Resource URI: (The current URI for this page, for reference purposes)
Brookhouse, James:
Otero, Fernando E.B.:
  • Depositors only (login required):


Downloads per month over past year