Semi-supervised Classification with Multiple Ants Maximal Spanning Tree

This paper presents a multiple ant colonies random walk model for semi-supervised classification task. Taking the multi-species competition mechanism into consideration, this model treats the limited labeled data as heterogeneous ant colonies according to the predefined classes, these colonies live in their nests and communicate indirectly by their unique types of pheromone. The unlabeled data set is taken as the food resources, which transforms the conventional classification problem into the scramble for resources among multiple ant colonies. During the swarm random walk in such an environment, every nest fights against others by the accumulation of different class pheromone on these resources for the possessions. The proposed algorithm is evaluated with real life benchmark datasets in terms of classification accuracy. Meanwhile the method is compared with other techniques. Experimental results show the potentiality of the proposed algorithm.

[1]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[2]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[3]  Alex Alves Freitas,et al.  Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..

[4]  Bart Baesens,et al.  Editorial survey: swarm intelligence for data mining , 2010, Machine Learning.

[5]  S. García,et al.  An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons , 2008 .

[6]  Alex Alves Freitas,et al.  Utilizing multiple pheromones in an ant-based algorithm for continuous-attribute classification rule discovery , 2013, Appl. Soft Comput..

[7]  Monique Snoeck,et al.  Classification With Ant Colony Optimization , 2007, IEEE Transactions on Evolutionary Computation.

[8]  Khalid M. Salama,et al.  Extensions to the Ant-Miner Classification Rule Discovery Algorithm , 2010, ANTS Conference.

[9]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  Israel A. Wagner,et al.  Efficiently searching a graph by a smell-oriented vertex process , 2004, Annals of Mathematics and Artificial Intelligence.

[11]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[12]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[13]  Ping He,et al.  Component Random Walk , 2012, ICIC.

[14]  David G. Stork,et al.  Pattern classification, 2nd Edition , 2000 .

[15]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[16]  R. Steele.  Optimization , 2005 .

[17]  Israel A. Wagner,et al.  Smell as a Computational Resource - A Lesson We Can Learn from the Ant , 1996, ISTCS.