Monotonicity in ant colony classification algorithms

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Classification algorithms generally do not use existing domain knowledge during model construction. The creation of models that conflict with existing knowledge can reduce model acceptance, as users have to trust the models they use. Domain knowledge can be integrated into algorithms using semantic constraints to guide model construction. This paper proposes an extension to an existing ACO-based classification rule learner to create lists of monotonic classification rules. The proposed algorithm was compared to a majority classifier and the Ordinal Learning Model (OLM) monotonic learner. Our results show that the proposed algorithm successfully outperformed OLM’s predictive accuracy while still producing monotonic models.

Cite

CITATION STYLE

APA

Brookhouse, J., & Otero, F. E. B. (2016). Monotonicity in ant colony classification algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9882 LNCS, pp. 137–148). Springer Verlag. https://doi.org/10.1007/978-3-319-44427-7_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free