Confidence-based ant random walks

To facilitate the computer-aided medical applications, this paper tries to build better intelligent diagnosis systems with the help of swarm intelligence method. As to the clinical data, a built-in graph structure is constructed with training samples being mapped as labeled vertices and test samples being unlabeled vertices. On the basis of the iterative label propagation algorithm, this paper first introduces a confidence-based random walk learning model, where unlabeled vertices that consistently show high probability (above the confidence threshold) in belonging to one class is treated as labeled vertices in the next iteration. Later motivated by the swarm intelligence, this model is further improved by treating the labeled vertices as real ants in nature and the predefined classes as different ant colonies. A novel labeled ant random walk algorithm is introduced by incorporating the history information of random walk in the form of aggregation pheromone. The proposed algorithms are evaluated with a synthetic data as well as some real-life clinical cases in terms of diagnostic accuracy. Experimental results show the potentiality of the proposed algorithms.

[1]  David J. Hand,et al.  Pattern Detection and Discovery , 2002, Pattern Detection and Discovery.

[2]  Shigeyoshi Tsutsui,et al.  Ant Colony Optimisation for Continuous Domains with Aggregation Pheromones Metaphor , 2004 .

[3]  Hamid R. Rabiee,et al.  Supervised neighborhood graph construction for semi-supervised classification , 2012, Pattern Recognit..

[4]  Ashish Ghosh,et al.  Aggregation pheromone density based data clustering , 2008, Inf. Sci..

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

[6]  Marco Saerens,et al.  Semi-supervised classification and betweenness computation on large, sparse, directed graphs , 2011, Pattern Recognit..

[7]  Jane You,et al.  Semi-supervised classification based on random subspace dimensionality reduction , 2012, Pattern Recognit..

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

[9]  Hiroshi Mamitsuka,et al.  Efficient semi-supervised learning on locally informative multiple graphs , 2012, Pattern Recognit..

[10]  Marco Dorigo Ant colony optimization , 2004, Scholarpedia.

[11]  Guozheng Li,et al.  Intelligent ZHENG Classification of Hypertension Depending on ML-kNN and Information Fusion , 2012, Evidence-based complementary and alternative medicine : eCAM.

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

[13]  Ashish Ghosh,et al.  Aggregation pheromone metaphor for semi-supervised classification , 2013, Pattern Recognit..

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

[15]  Claudio Gentile,et al.  Random Spanning Trees and the Prediction of Weighted Graphs , 2010, ICML.

[16]  Ping He,et al.  Protein localization prediction using random walks on graphs , 2013, BMC Bioinformatics.

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

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

[19]  Zoubin Ghahramani,et al.  Learning from labeled and unlabeled data with label propagation , 2002 .