Skip to main content
Kent Academic Repository

Using an Ant Colony Optimization Algorithm for Monotonic Regression Rule Discovery

Brookhouse, James, Otero, Fernando E.B. (2016) Using an Ant Colony Optimization Algorithm for Monotonic Regression Rule Discovery. In: Genetic and Evolutionary Computation Conference (GECCO 2016), 20-24 July 2016, Denver, United States. (doi:10.1145/2908812.2908896) (KAR id:55191)


Many data mining algorithms do not make use of existing domain knowledge when constructing their models. This can lead to model rejection as users may not trust models that behave contrary to their expectations. Semantic constraints provide a way to encapsulate this knowledge which can then be used to guide the construction of models. One of the most studied semantic constraints in the literature is monotonicity, however current monotonically-aware algorithms have focused on ordinal classification problems. This paper proposes an extension to an ACO-based regression algorithm in order to extract a list of monotonic regression rules. We compared the proposed algorithm against a greedy regression rule induction algorithm that preserves monotonic constraints and the well-known M5’ Rules. Our experiments using eight publicly available data sets show that the proposed algorithm successfully creates monotonic rules while maintaining predictive accuracy.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1145/2908812.2908896
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Fernando Otero
Date Deposited: 29 Apr 2016 09:00 UTC
Last Modified: 08 Dec 2022 22:01 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.