Skip to main content

Monotonicity in Ant Colony Classification Algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9882))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    An example is covered by a rule when it satisfies all terms (attribute-value conditions) in the antecedent of the rule.

  2. 2.

    ACO-based algorithms therefore run a total of 50 times before the average is taken.

References

  1. Ben-David, A.: Monotonicity maintenancs in information-theoretic machine learning algorithms. Mach. Learn. 19, 29–43 (1995)

    Google Scholar 

  2. Ben-David, A., Sterling, L., Tran, T.: Adding monoticity to learning algorithms may impair their accuracy. Expert Syst. Appl. 36, 6627–6634 (2009)

    Article  Google Scholar 

  3. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26, 29–41 (1996)

    Article  Google Scholar 

  4. Dorigo, M., Stutzle, T.: Ant Colony Optimization. A Bradford Book. The MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  5. Duivesteijn, W., Feelders, A.: Nearest neighbour classification with monotonicity constraints. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008, Part I. LNCS (LNAI), vol. 5211, pp. 301–316. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Fayyad, U., Piatetsky-Shapiro, G., Smith, P.: From data mining to knowledge discovery: an overview. In: Advances in Knowledge Discovery & Data Mining, pp. 1–34. MIT Press (1996)

    Google Scholar 

  7. Feelders, A., Pardoel, M.: Pruning for monotone classification trees. In: Berthold, M., Lenz, H.-J., Bradley, E., Kruse, R., Borgelt, C. (eds.) IDA 2003. LNCS, vol. 2810, pp. 1–12. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Fürnkranz, J.: Separate-and-conquer rule learning. Artif. Intell. Rev. 13(1), 3–54 (1999)

    Article  MATH  Google Scholar 

  9. Hoover, K., Perez, S.: Three attitudes towards data mining. J. Econ. Methodol. 7(2), 195–210 (2000)

    Article  Google Scholar 

  10. Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml

  11. Martens, D., De Backer, M., Haesen, R., Baesens, B., Mues, C., Vanthienen, J.: Ant-based approach to the knowledge fusion problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 84–95. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Martens, D., Backer, M.D., Haesen, R., Vanthienen, J., Snoeck, M., Baesens, B.: Classification with ant colony optimization. IEEE Trans. Evol. Comput. 11(5), 651–665 (2007)

    Article  Google Scholar 

  13. Martens, D., Baesens, B., Fawcett, T.: Editorial survey: swarm intelligence for data mining. Mach. Learn. 82(1), 1–42 (2011)

    Article  MathSciNet  Google Scholar 

  14. Otero, F., Freitas, A., Johnson, C.: A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Trans. Evol. Comput. 17(1), 64–76 (2013)

    Article  Google Scholar 

  15. Parpinelli, R., Lopes, H., Freitas, A.: Data mining with an ant colony optimization algorithm. IEEE Trans. Evol. Comput. 6(4), 321–332 (2002)

    Article  MATH  Google Scholar 

  16. Potharst, R., Ben-David, A., van Wezel, M.: Two algorithms for generating structured and unstructured monotone ordinal data sets. Eng. Appl. Artif. Intell. 22(4), 491–496 (2009)

    Article  Google Scholar 

  17. Qian, Y., Xu, H., Liang, J., Liu, B., Wang, J.: Fusing monotonic decision trees. IEEE Trans. Knowl. Data Eng. 27(10), 2717–2728 (2015)

    Article  Google Scholar 

  18. Witten, H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to James Brookhouse .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Brookhouse, J., Otero, F.E.B. (2016). Monotonicity in Ant Colony Classification Algorithms. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2016. Lecture Notes in Computer Science(), vol 9882. Springer, Cham. https://doi.org/10.1007/978-3-319-44427-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44427-7_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44426-0

  • Online ISBN: 978-3-319-44427-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics