Skip to main content
Top
Published in: Soft Computing 19/2017

26-04-2016 | Methodologies and Application

Ant colony classification mining algorithm based on pheromone attraction and exclusion

Authors: Lei Yang, Kangshun Li, Wensheng Zhang, Zhenxu Ke

Published in: Soft Computing | Issue 19/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Ant colony optimization algorithms have been applied successfully in classification rule mining. However, basic ant colony classification mining algorithms generally suffer from problems, such as premature convergence and falling into local optimum easily. Simultaneously, the classification mining algorithms use sequential covering strategy to discover rules, and the interaction between rules is less considered. In this study, a new ant colony classification mining algorithm based on pheromone attraction and exclusion (Ant-Miner\(_\mathrm{PAE}\)) is proposed, in which a new pheromone calculation method is designed and the search is guided by the new probability transfer formula. By contrast,the basic algorithm structure is modified, and the order of the iteration is adjusted. Thus, the problem of rule interaction is mitigated. Ant-Miner\(_\mathrm{PAE}\) can balance the relation of exploration and development of constructing rules, which can make the ants in the search process initially explore and develop in the later period. Our experiments, which use 12 publicly available data sets, show that the predictive accuracy obtained by Ant-Miner\(_\mathrm{PAE}\) implementing the proposed pheromone attraction and exclusion strategy is statistically significantly higher than the predictive accuracy of other rule induction classification algorithms, such as CN2, C4.5 rules, PSO/ACO2, Ant-Miner, and cAnt-Miner\(_\mathrm{PB}\). Furthermore, the rules discovered by Ant-Miner\(_\mathrm{PAE}\) are considerably simpler than those discovered by its counterparts.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
go back to reference Chan A, Freitas AA (2006) A new ant colony algorithm for multi-label classification with applications in bioinfomatics. Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 27–34 Chan A, Freitas AA (2006) A new ant colony algorithm for multi-label classification with applications in bioinfomatics. Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 27–34
go back to reference Chan A, Freitas AA (2006) A new classification-rule pruning procedure for an ant colony algorithm. Artificial evolution. Springer, New York, pp 25–36CrossRef Chan A, Freitas AA (2006) A new classification-rule pruning procedure for an ant colony algorithm. Artificial evolution. Springer, New York, pp 25–36CrossRef
go back to reference Clark P, Boswell R (1991) Rule induction with CN2: some recent improvements. Machine learning EWSL-91. Springer, New York, pp 151–163CrossRef Clark P, Boswell R (1991) Rule induction with CN2: some recent improvements. Machine learning EWSL-91. Springer, New York, pp 151–163CrossRef
go back to reference Clark P, Niblett T (1989) The CN2 induction algorithm. Mach Learn 3(4):261–283 Clark P, Niblett T (1989) The CN2 induction algorithm. Mach Learn 3(4):261–283
go back to reference De López R, Mántaras M (1991) A distance-based attribute selection measure for decision tree induction. Mach Learn 6(1):81–92CrossRef De López R, Mántaras M (1991) A distance-based attribute selection measure for decision tree induction. Mach Learn 6(1):81–92CrossRef
go back to reference Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MathSciNetMATH Demšar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1–30MathSciNetMATH
go back to reference Dhar V, Chou D, Provost F (2000) Discovering interesting patterns for investment decision making with glowera genetic learner overlaid with entropy reduction. Data Min Knowl Discov 4(4):251–280CrossRefMATH Dhar V, Chou D, Provost F (2000) Discovering interesting patterns for investment decision making with glowera genetic learner overlaid with entropy reduction. Data Min Knowl Discov 4(4):251–280CrossRefMATH
go back to reference Dorigo M (1994) Learning by probabilistic boolean networks. IEEE world congress on computational intelligence, IEEE international conference on neural networks, vol 2. IEEE, New York, pp 887–891 Dorigo M (1994) Learning by probabilistic boolean networks. IEEE world congress on computational intelligence, IEEE international conference on neural networks, vol 2. IEEE, New York, pp 887–891
go back to reference Dorigo M, Stützle T (2004) Ant colony optimization for NP-hard problems. Ant Colony Optimization. MIT press, pp 153–222 Dorigo M, Stützle T (2004) Ant colony optimization for NP-hard problems. Ant Colony Optimization. MIT press, pp 153–222
go back to reference Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29–41CrossRef Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29–41CrossRef
go back to reference Freitas AA, Wieser DC, Apweiler R (2010) On the importance of comprehensible classification models for protein function prediction. IEEE/ACM Trans Comput Biol Bioinform (TCBB) 7(1):172–182CrossRef Freitas AA, Wieser DC, Apweiler R (2010) On the importance of comprehensible classification models for protein function prediction. IEEE/ACM Trans Comput Biol Bioinform (TCBB) 7(1):172–182CrossRef
go back to reference Han J, Kamber M (2001) Data mining: concepts and technologies. Data Mining Concepts Models Methods & Algorithms, 2nd edn, 5(4):1–18 Han J, Kamber M (2001) Data mining: concepts and technologies. Data Mining Concepts Models Methods & Algorithms, 2nd edn, 5(4):1–18
go back to reference Jin P, Zhu Y, Hu K, Li S (2006) Classification rule mining based on ant colony optimization algorithm. Intelligent control and automation. Springer, New York, pp 654–663 Jin P, Zhu Y, Hu K, Li S (2006) Classification rule mining based on ant colony optimization algorithm. Intelligent control and automation. Springer, New York, pp 654–663
go back to reference Kaltenbacher B (2001) On the regularizing properties of a full multigrid method for ill-posed problems. Inverse Probl 17(4):767–788MathSciNetCrossRefMATH Kaltenbacher B (2001) On the regularizing properties of a full multigrid method for ill-posed problems. Inverse Probl 17(4):767–788MathSciNetCrossRefMATH
go back to reference Kaltenbacher B, Schicho J (2002) A multi-grid method with a priori and a posteriori level choice for the regularization of nonlinear ill-posed problems. Numer Math 93(1):77–107 Kaltenbacher B, Schicho J (2002) A multi-grid method with a priori and a posteriori level choice for the regularization of nonlinear ill-posed problems. Numer Math 93(1):77–107
go back to reference Keung YL, Zou J (2000) An efficient linear solver for nonlinear parameter identification problems. Siam J Sci Compt 22(5):1511–1526 Keung YL, Zou J (2000) An efficient linear solver for nonlinear parameter identification problems. Siam J Sci Compt 22(5):1511–1526
go back to reference Kohavi R, Sahami M (1996) Error-based and entropy-based discretization of continuous features. In: KDD, pp 114–119 Kohavi R, Sahami M (1996) Error-based and entropy-based discretization of continuous features. In: KDD, pp 114–119
go back to reference Liu B, Pan J (2007) Research of classification algorithm based on ant colony optimization. Comput Appl Softw 24(4):50–53 Liu B, Pan J (2007) Research of classification algorithm based on ant colony optimization. Comput Appl Softw 24(4):50–53
go back to reference Liu B, Abbass HA, McKay B (2002) Density-based heuristic for rule discovery with ant-miner. In: The 6th Australia-Japan joint workshop on intelligent and evolutionary system, vol 184, Citeseer Liu B, Abbass HA, McKay B (2002) Density-based heuristic for rule discovery with ant-miner. In: The 6th Australia-Japan joint workshop on intelligent and evolutionary system, vol 184, Citeseer
go back to reference Liu B, Abbass HA, McKay B (2003) Classification rule discovery with ant colony optimization. In: Null. IEEE, New York, p 83 Liu B, Abbass HA, McKay B (2003) Classification rule discovery with ant colony optimization. In: Null. IEEE, New York, p 83
go back to reference Martens D, De Backer M, Haesen R, Vanthienen J, Snoeck M, Baesens B (2007) Classification with ant colony optimization. IEEE Trans Evol Comput 11(5):651–665CrossRef Martens D, De Backer M, Haesen R, Vanthienen J, Snoeck M, Baesens B (2007) Classification with ant colony optimization. IEEE Trans Evol Comput 11(5):651–665CrossRef
go back to reference Otero FEB, Freitas AA, Johnson CG (2008) Cant-miner: an ant colony classification algorithm to cope with continuous attributes. Ant colony optimization and swarm intelligence. Springer, New York, pp 48–59CrossRef Otero FEB, Freitas AA, Johnson CG (2008) Cant-miner: an ant colony classification algorithm to cope with continuous attributes. Ant colony optimization and swarm intelligence. Springer, New York, pp 48–59CrossRef
go back to reference Otero FEB, Freitas A, Johnson CG et al (2009) Handling continuous attributes in ant colony classification algorithms. IEEE symposium on computational intelligence and data mining, CIDM’09. IEEE, New York, pp 225–231CrossRef Otero FEB, Freitas A, Johnson CG et al (2009) Handling continuous attributes in ant colony classification algorithms. IEEE symposium on computational intelligence and data mining, CIDM’09. IEEE, New York, pp 225–231CrossRef
go back to reference Otero FEB, Freitas A, Johnson Colin G et al (2013) A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Trans Evol Comput 17(1):64–76CrossRef Otero FEB, Freitas A, Johnson Colin G et al (2013) A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Trans Evol Comput 17(1):64–76CrossRef
go back to reference Parpinelli RS, Lopes HS, Freitas AA (2001) An ant colony based system for data mining: applications to medical data. In: Proceedings of the genetic and evolutionary computation conference (GECCO-2001), pp 791–797, Citeseer Parpinelli RS, Lopes HS, Freitas AA (2001) An ant colony based system for data mining: applications to medical data. In: Proceedings of the genetic and evolutionary computation conference (GECCO-2001), pp 791–797, Citeseer
go back to reference Parpinelli Rafael S, Lopes Heitor S, Freitas A et al (2002a) Data mining with an ant colony optimization algorithm. IEEE Trans Evol Comput 6(4):321–332CrossRefMATH Parpinelli Rafael S, Lopes Heitor S, Freitas A et al (2002a) Data mining with an ant colony optimization algorithm. IEEE Trans Evol Comput 6(4):321–332CrossRefMATH
go back to reference Parpinelli RS, Lopes HS, Freitas AA (2002) An ant colony algorithm for classification rule discovery. In: Data mining: a heuristic approach, pp 191–208 Parpinelli RS, Lopes HS, Freitas AA (2002) An ant colony algorithm for classification rule discovery. In: Data mining: a heuristic approach, pp 191–208
go back to reference Quinlan JR (2014) C4.5: programs for machine learning. Elsevier, New York Quinlan JR (2014) C4.5: programs for machine learning. Elsevier, New York
go back to reference Smaldon J, Freitas AA (2006) A new version of the ant-miner algorithm discovering unordered rule sets. Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 43–50 Smaldon J, Freitas AA (2006) A new version of the ant-miner algorithm discovering unordered rule sets. Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, New York, pp 43–50
go back to reference Wang Z, Feng B (2005) Classification rule mining with an improved ant colony algorithm. AI 2004: advances in artificial intelligence. Springer, New York, pp 357–367 Wang Z, Feng B (2005) Classification rule mining with an improved ant colony algorithm. AI 2004: advances in artificial intelligence. Springer, New York, pp 357–367
Metadata
Title
Ant colony classification mining algorithm based on pheromone attraction and exclusion
Authors
Lei Yang
Kangshun Li
Wensheng Zhang
Zhenxu Ke
Publication date
26-04-2016
Publisher
Springer Berlin Heidelberg
Published in
Soft Computing / Issue 19/2017
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-016-2151-9

Other articles of this Issue 19/2017

Soft Computing 19/2017 Go to the issue

Premium Partner