Skip to main content
Top
Published in: Pattern Recognition and Image Analysis 3/2019

01-07-2019 | MATHEMATICAL METHOD IN PATTERN RECOGNITION

A Clustering Based Classification Approach Based on Modified Cuckoo Search Algorithm

Authors: Krishna Gopal Dhal, Arunita Das, Swarnajit Ray, Sanjoy Das

Published in: Pattern Recognition and Image Analysis | Issue 3/2019

Log in

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

search-config
loading …

Abstract

Cuckoo Search Algorithm (CSA) is one of the new swarm intelligence based optimization algorithms, which has shown an effective performance on many optimization problems. However, the effectiveness of CSA significantly depends on the exploration and exploitation potential and it may also possible to increase its efficiency when solving complex optimization problems. In this study, some mechanisms have been employed on CSA to increase its efficiency such as use of global best and individual best solutions to guide the other solutions, self-adaption techniques for parameters and so on. The modified CSA (i.e., MCSA) is successfully employed in clustering based classification domain. The experimental results and execution time prove its effectiveness over existing modified CSAs and other employed swarm intelligence algorithms. The proposed clustering model is also employed in color histopathological image segmentation domain and provides effective result.

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
1.
go back to reference M. R. Anderberg, Cluster Analysis for Application (Academic Press, New York, 1973).MATH M. R. Anderberg, Cluster Analysis for Application (Academic Press, New York, 1973).MATH
2.
go back to reference J. A. Hartigan, Clustering Algorithms (Wiley, New York, 1975).MATH J. A. Hartigan, Clustering Algorithms (Wiley, New York, 1975).MATH
3.
go back to reference P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach (Prentice-Hall, London, 1982).MATH P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach (Prentice-Hall, London, 1982).MATH
4.
go back to reference A. K. Jain and R. C. Dubes, Algorithms for Clustering Data (Prentice-Hall, Englewood Cliffs, 1988).MATH A. K. Jain and R. C. Dubes, Algorithms for Clustering Data (Prentice-Hall, Englewood Cliffs, 1988).MATH
5.
go back to reference Y. Leung, J.-S. Zhang, and Z.-B. Xu, “Clustering by scale-space filtering,” IEEE Trans. Pattern Anal. Mach. Intell. 22 (12), 1396–1410 (2000).CrossRef Y. Leung, J.-S. Zhang, and Z.-B. Xu, “Clustering by scale-space filtering,” IEEE Trans. Pattern Anal. Mach. Intell. 22 (12), 1396–1410 (2000).CrossRef
6.
go back to reference J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symposium on Mathematics and Statistical Probability (Berkeley, CA, USA, 1967), Vol. 1 (Univ. of Calif. Press, 1967), pp. 281–297. J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symposium on Mathematics and Statistical Probability (Berkeley, CA, USA, 1967), Vol. 1 (Univ. of Calif. Press, 1967), pp. 281–297.
7.
go back to reference E. Falkenauer, Genetic Algorithms and Grouping Problems (Wiley, Chichester, UK, 1998).MATH E. Falkenauer, Genetic Algorithms and Grouping Problems (Wiley, Chichester, UK, 1998).MATH
8.
go back to reference S. Paterlini and T. Minerva, “Evolutionary approaches for cluster analysis,” in Soft Computing Applications, Ed. by A. Bonarini, F. Masulli, and G. Pasi, Advances in Soft Computing (Springer, Physica, Heidelberg, 2003), Vol. 18, pp. 167–178. S. Paterlini and T. Minerva, “Evolutionary approaches for cluster analysis,” in Soft Computing Applications, Ed. by A. Bonarini, F. Masulli, and G. Pasi, Advances in Soft Computing (Springer, Physica, Heidelberg, 2003), Vol. 18, pp. 167–178.
9.
go back to reference C.-H. Tsang and S. Kwong, “Ant colony clustering and feature extraction for anomaly intrusion detection,” in Swarm Intelligence in Data Mining, Ed. by A. Abraham, C. Grosan, and V. Ramos, Studies in Computational Intelligence (Springer, Berlin, Heidelberg, 2006), Vol. 34, pp. 101–123. C.-H. Tsang and S. Kwong, “Ant colony clustering and feature extraction for anomaly intrusion detection,” in Swarm Intelligence in Data Mining, Ed. by A. Abraham, C. Grosan, and V. Ramos, Studies in Computational Intelligence (Springer, Berlin, Heidelberg, 2006), Vol. 34, pp. 101–123.
10.
go back to reference R. Younsi and W. Wang, “A new artificial immune system algorithm for clustering,” in Intelligent Data Engineering and Automated Learning – IDEAL 2004, Ed. by Z. R. Yang, H. Yin, and R. M. Everson, Lecture Notes in Computer Science (Springer, Berlin, Heidelberg, 2004), Vol. 3177, pp. 58–64. R. Younsi and W. Wang, “A new artificial immune system algorithm for clustering,” in Intelligent Data Engineering and Automated LearningIDEAL 2004, Ed. by Z. R. Yang, H. Yin, and R. M. Everson, Lecture Notes in Computer Science (Springer, Berlin, Heidelberg, 2004), Vol. 3177, pp. 58–64.
11.
go back to reference P. S. Shelokar, V. K. Jayaraman, and B. D. Kulkarni, “An ant colony approach for clustering,” Anal. Chim. Acta 509 (2), 187–195 (2004).CrossRef P. S. Shelokar, V. K. Jayaraman, and B. D. Kulkarni, “An ant colony approach for clustering,” Anal. Chim. Acta 509 (2), 187–195 (2004).CrossRef
12.
go back to reference S. Paterlini and T. Krink, “Differential evolution and particle swarm optimisation in partitional clustering,” Comput. Stat. Data Anal. 50 (5), 1220–1247 (2006).MathSciNetCrossRefMATH S. Paterlini and T. Krink, “Differential evolution and particle swarm optimisation in partitional clustering,” Comput. Stat. Data Anal. 50 (5), 1220–1247 (2006).MathSciNetCrossRefMATH
13.
go back to reference Y. Kao and K. Cheng, “An ACO-based clustering algorithm,” in Ant Colony Optimization and Swarm Intelligence, ANTS 2006, Ed. by M. Dorigo, Lecture Notes in Computer Science (Springer, Berlin, Heidelberg, 2006), Vol. 4150, pp. 340–347. Y. Kao and K. Cheng, “An ACO-based clustering algorithm,” in Ant Colony Optimization and Swarm Intelligence, ANTS 2006, Ed. by M. Dorigo, Lecture Notes in Computer Science (Springer, Berlin, Heidelberg, 2006), Vol. 4150, pp. 340–347.
14.
go back to reference M. Omran, A. Engelbrecht, and A. Salman, “Particle swarm optimization method for image clustering,” Int. J. Pattern Recogn. Artif. Intell. 19 (3), 297–322 (2005).CrossRef M. Omran, A. Engelbrecht, and A. Salman, “Particle swarm optimization method for image clustering,” Int. J. Pattern Recogn. Artif. Intell. 19 (3), 297–322 (2005).CrossRef
15.
go back to reference S. J. Nanda and G. Panda, “A survey on nature inspired metaheuristic algorithms for partitional clustering,” Swarm Evol. Comput. 16, 1–18 (2014).CrossRef S. J. Nanda and G. Panda, “A survey on nature inspired metaheuristic algorithms for partitional clustering,” Swarm Evol. Comput. 16, 1–18 (2014).CrossRef
16.
go back to reference T. Niknam, B. Amiri, J. Olamaei, and A. Arefi, “An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering,” J. Zhejiang Univ. Sci. A 10 (4), 512–519 (2009).CrossRefMATH T. Niknam, B. Amiri, J. Olamaei, and A. Arefi, “An efficient hybrid evolutionary optimization algorithm based on PSO and SA for clustering,” J. Zhejiang Univ. Sci. A 10 (4), 512–519 (2009).CrossRefMATH
17.
go back to reference T. Niknam, E. Taherian Fard, N. Pourjafarian, and A. R. Rousta, “An efficient hybrid algorithm based on modified imperialist competitive algorithm and k-means for data clustering,” Eng. Appl. Artif. Intell. 24 (2), 306–317 (2011).CrossRef T. Niknam, E. Taherian Fard, N. Pourjafarian, and A. R. Rousta, “An efficient hybrid algorithm based on modified imperialist competitive algorithm and k-means for data clustering,” Eng. Appl. Artif. Intell. 24 (2), 306–317 (2011).CrossRef
18.
go back to reference T. Niknam and B. Amiri, “An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis,” Appl. Soft Comput. 10 (1), 183–197 (2010).CrossRef T. Niknam and B. Amiri, “An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis,” Appl. Soft Comput. 10 (1), 183–197 (2010).CrossRef
19.
go back to reference I. De Falco, A. D. Cioppa, and E. Tarantino, “Facing classification problems with particle swarm optimization,” Appl. Soft Comput. 7 (3), 652–658 (2007).CrossRef I. De Falco, A. D. Cioppa, and E. Tarantino, “Facing classification problems with particle swarm optimization,” Appl. Soft Comput. 7 (3), 652–658 (2007).CrossRef
20.
go back to reference F. V. Jensen, An Introduction to Bayesian Networks (UCL Press, London, 1996). F. V. Jensen, An Introduction to Bayesian Networks (UCL Press, London, 1996).
21.
go back to reference D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representation by back propagation errors,” Nature 323, 533–536 (1986).CrossRefMATH D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representation by back propagation errors,” Nature 323, 533–536 (1986).CrossRefMATH
22.
go back to reference M. H. Hassoun, Fundamentals of Artificial Neural Networks (MIT Press, Cambridge, MA, 1995).MATH M. H. Hassoun, Fundamentals of Artificial Neural Networks (MIT Press, Cambridge, MA, 1995).MATH
23.
go back to reference J. G. Cleary and L. E. Trigg, “K*: An instance-based learner using an entropic distance measure,” in Proc. 12th Int. Conf. on Machine Learning, Tahoe City, CA, 1995, Machine Learning Proceedings 1995 (Morgan Kaufmann, San Francisco, 1995), pp. 108–114. J. G. Cleary and L. E. Trigg, “K*: An instance-based learner using an entropic distance measure,” in Proc. 12th Int. Conf. on Machine Learning, Tahoe City, CA, 1995, Machine Learning Proceedings 1995 (Morgan Kaufmann, San Francisco, 1995), pp. 108–114.
24.
go back to reference L. Breiman, “Bagging predictors,” Mach. Learn. 24 (2), 123–140 (1996).MATH L. Breiman, “Bagging predictors,” Mach. Learn. 24 (2), 123–140 (1996).MATH
25.
go back to reference G. I. Webb, “Multi boosting: A technique for combining boosting and wagging,” Mach. Learn. 40 (2), 159–196 (2000).CrossRef G. I. Webb, “Multi boosting: A technique for combining boosting and wagging,” Mach. Learn. 40 (2), 159–196 (2000).CrossRef
26.
go back to reference R. Kohavi, “Scaling up the accuracy of Naive–Bayes classifiers: A decision tree hybrid,” in Proc. Second Int. Conf. on Knowledge Discovery and Data Mining (KDD’96) (Portland, OR, USA, 1996) (AAAI Press, 1996), pp. 202–207. R. Kohavi, “Scaling up the accuracy of Naive–Bayes classifiers: A decision tree hybrid,” in Proc. Second Int. Conf. on Knowledge Discovery and Data Mining (KDD96) (Portland, OR, USA, 1996) (AAAI Press, 1996), pp. 202–207.
27.
go back to reference P. Compton and R. Jansen, “Knowledge in context: A strategy for expert system maintenance,” in AI’88, Proc. 2nd Australian Joint Artificial Intelligence Conference, Ed. by C. J. Barter and M. J. Brooks, Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) (Springer, Berlin, Heidelberg, 1990), Vol. 406, pp. 292–306. P. Compton and R. Jansen, “Knowledge in context: A strategy for expert system maintenance,” in AI88, Proc. 2nd Australian Joint Artificial Intelligence Conference, Ed. by C. J. Barter and M. J. Brooks, Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) (Springer, Berlin, Heidelberg, 1990), Vol. 406, pp. 292–306.
28.
go back to reference G. Demiröz and H. A. Güvenir, “Classification by voting feature intervals,” in Machine Learning: ECML-97, Proc. 9th European Conf. on Machine Learning, Ed. by M. van Someren and G. Widmer, Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) (Springer, Berlin, Heidelberg, 1997), Vol. 1224, pp. 85–92. G. Demiröz and H. A. Güvenir, “Classification by voting feature intervals,” in Machine Learning: ECML-97, Proc. 9th European Conf. on Machine Learning, Ed. by M. van Someren and G. Widmer, Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence) (Springer, Berlin, Heidelberg, 1997), Vol. 1224, pp. 85–92.
29.
go back to reference D. Karaboga and C. Ozturk, “A novel cluster approach: Artificial Bee Colony (ABC) algorithm,” Appl. Soft Comput. 11 (1), 652–657 (2010).CrossRef D. Karaboga and C. Ozturk, “A novel cluster approach: Artificial Bee Colony (ABC) algorithm,” Appl. Soft Comput. 11 (1), 652–657 (2010).CrossRef
30.
go back to reference I. B. Saida, K. Nadjet, and B. Omar, “A new algorithm for data clustering based on cuckoo search optimization,” in Genetic and Evolutionary Computing, Ed. by J. S. Pan, P. Krömer, and V. Snášel, Advances in Intelligent Systems and Computing (Springer, Cham, 2014), Vol. 238, pp. 55–64. I. B. Saida, K. Nadjet, and B. Omar, “A new algorithm for data clustering based on cuckoo search optimization,” in Genetic and Evolutionary Computing, Ed. by J. S. Pan, P. Krömer, and V. Snášel, Advances in Intelligent Systems and Computing (Springer, Cham, 2014), Vol. 238, pp. 55–64.
31.
go back to reference J. Senthilnath, S. N. Omkar, and V. Mani, “Clustering using firefly algorithm: Performance study,” Swarm Evol. Comput. 1 (3), 164–171 (2011).CrossRef J. Senthilnath, S. N. Omkar, and V. Mani, “Clustering using firefly algorithm: Performance study,” Swarm Evol. Comput. 1 (3), 164–171 (2011).CrossRef
32.
go back to reference J. Senthilnath, Sushant Kulkarni, J. A. Benediktsson, and X. S. Yang, “A novel approach for multispectral satellite image classification based on the bat algorithm,” IEEE Geosci. Remote Sens. Lett. 13 (4), 599–603 (2016).CrossRef J. Senthilnath, Sushant Kulkarni, J. A. Benediktsson, and X. S. Yang, “A novel approach for multispectral satellite image classification based on the bat algorithm,” IEEE Geosci. Remote Sens. Lett. 13 (4), 599–603 (2016).CrossRef
33.
go back to reference J. Zhao, X. Lei, Z. Wu, and Y. Tan, “Clustering using improved cuckoo search algorithm,” in Advances in Swarm Intelligence, ICSI 2014, Part I, Ed. by Y. Tan, Y. Shi, and C. A. C. Coello, Lecture Notes in Computer Science (Springer, Cham, 2014), Vol. 8794, pp. 479–488. J. Zhao, X. Lei, Z. Wu, and Y. Tan, “Clustering using improved cuckoo search algorithm,” in Advances in Swarm Intelligence, ICSI 2014, Part I, Ed. by Y. Tan, Y. Shi, and C. A. C. Coello, Lecture Notes in Computer Science (Springer, Cham, 2014), Vol. 8794, pp. 479–488.
34.
go back to reference C. Cobos, H. Muñoz-Collazos, R. Urbano-Muñoz, M. Mendoza, E. León, and E. Herrera-Viedma, “Clustering of web search results based on the cuckoo search algorithm and Balanced Bayesian Information Criterion,” Inf. Sci. 281, 248–264 (2014).CrossRef C. Cobos, H. Muñoz-Collazos, R. Urbano-Muñoz, M. Mendoza, E. León, and E. Herrera-Viedma, “Clustering of web search results based on the cuckoo search algorithm and Balanced Bayesian Information Criterion,” Inf. Sci. 281, 248–264 (2014).CrossRef
35.
go back to reference S. Goel, A. Sharma, and P. Bedi, “Novel approaches for classification based on Cuckoo Search Strategy,” Int. J. Hybrid Intell. Syst. 10 (3), 107–116 (2013).CrossRef S. Goel, A. Sharma, and P. Bedi, “Novel approaches for classification based on Cuckoo Search Strategy,” Int. J. Hybrid Intell. Syst. 10 (3), 107–116 (2013).CrossRef
36.
go back to reference K. G. Dhal, Md. I. Quraishi, and S. Das, “An improved cuckoo search based optimal ranged brightness preserved histogram equalization and contrast stretching method,” Int. J. Swarm Intell. Res. 8 (1), 1–29 (2017).CrossRef K. G. Dhal, Md. I. Quraishi, and S. Das, “An improved cuckoo search based optimal ranged brightness preserved histogram equalization and contrast stretching method,” Int. J. Swarm Intell. Res. 8 (1), 1–29 (2017).CrossRef
37.
go back to reference C. L. Blake and C. J. Merz, University of California at Irvine Repository of Machine Learning Databases (1998). http://www.ics.uci.edu/mlearn/MLRepository.html C. L. Blake and C. J. Merz, University of California at Irvine Repository of Machine Learning Databases (1998). http://​www.​ics.​uci.​edu/​mlearn/​MLRepository.​html
38.
go back to reference X.-S. Yang, and S. Deb, “Cuckoo Search via lévy flight,” in Proc. 2009 World Congress on Nature and Biologically Inspired Computing (NaBIC 2009) (Coimbatore, India, 2009), IEEE, pp. 210–214. X.-S. Yang, and S. Deb, “Cuckoo Search via lévy flight,” in Proc. 2009 World Congress on Nature and Biologically Inspired Computing (NaBIC 2009) (Coimbatore, India, 2009), IEEE, pp. 210–214.
39.
go back to reference J. Kennedy, “Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance,” in Proc. 1999 Congress on Evolutionary Computation (CEC99) (Washington, USA, 1999), IEEE, Vol. 3, pp. 1931–1938. J. Kennedy, “Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance,” in Proc. 1999 Congress on Evolutionary Computation (CEC99) (Washington, USA, 1999), IEEE, Vol. 3, pp. 1931–1938.
40.
go back to reference H. Wang, Z. Wu, and S. Rahnamayan, “Particle swarm optimisation with simple and efficient neighbourhood search strategies,” Int. J. Innovative Comput. Appl. 3 (2), 97–104 (2011).CrossRef H. Wang, Z. Wu, and S. Rahnamayan, “Particle swarm optimisation with simple and efficient neighbourhood search strategies,” Int. J. Innovative Comput. Appl. 3 (2), 97–104 (2011).CrossRef
41.
go back to reference S. Das, A. Abraham, U. K. Chakraborty, and A. Konar, “Differential evolution using a neighborhood-based mutation operator,” IEEE Trans. Evol. Comput. 13 (3), 526–553 (2009).CrossRef S. Das, A. Abraham, U. K. Chakraborty, and A. Konar, “Differential evolution using a neighborhood-based mutation operator,” IEEE Trans. Evol. Comput. 13 (3), 526–553 (2009).CrossRef
42.
go back to reference H. Wang, Z. Cui, H. Sun, S. Rahnamayan, and X.‑S. Yang, “Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism,” Soft Comput. 21 (18), 5325–5339 (2017).CrossRef H. Wang, Z. Cui, H. Sun, S. Rahnamayan, and X.‑S. Yang, “Randomly attracted firefly algorithm with neighborhood search and dynamic parameter adjustment mechanism,” Soft Comput. 21 (18), 5325–5339 (2017).CrossRef
43.
go back to reference L. dos Santos Coelho and V. C. Mariani, “A novel particle swarm optimization approach using Hénon map and implicit filtering local search for economic load dispatch,” Chaos, Solitons Fractals 39 (2), 510–518 (2009).CrossRef L. dos Santos Coelho and V. C. Mariani, “A novel particle swarm optimization approach using Hénon map and implicit filtering local search for economic load dispatch,” Chaos, Solitons Fractals 39 (2), 510–518 (2009).CrossRef
44.
go back to reference R. Sheikholeslami and A. Kaveh, “A survey of chaos embedded meta-heuristic algorithms,” Int. J. Optim. Civil. Eng. 3 (4), 617–633 (2013). R. Sheikholeslami and A. Kaveh, “A survey of chaos embedded meta-heuristic algorithms,” Int. J. Optim. Civil. Eng. 3 (4), 617–633 (2013).
45.
go back to reference L. dos Santos Coelho and V. C. Mariani, “Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization,” Expert Syst. Appl. 34 (3), 1905–1913 (2008).CrossRef L. dos Santos Coelho and V. C. Mariani, “Use of chaotic sequences in a biologically inspired algorithm for engineering design optimization,” Expert Syst. Appl. 34 (3), 1905–1913 (2008).CrossRef
46.
go back to reference A. R. Jordehi, “A chaotic-based big bang–big crunch algorithm for solving global optimisation problems,” Neural Comput. Appl. 25 (6), 1329–1335 (2014).CrossRef A. R. Jordehi, “A chaotic-based big bang–big crunch algorithm for solving global optimisation problems,” Neural Comput. Appl. 25 (6), 1329–1335 (2014).CrossRef
47.
go back to reference C. Choi and J.-J. Lee, “Chaotic local search algorithm,” Artif. Life Rob. 2 (1), 41–47 (1998).CrossRef C. Choi and J.-J. Lee, “Chaotic local search algorithm,” Artif. Life Rob. 2 (1), 41–47 (1998).CrossRef
48.
go back to reference J. C. Bansal, P. K. Singh, M. Saraswat, A. Verma, S. S. Jadon, and A. Abraham, “Inertia Weight strategies in Particle Swarm Optimization,” in Proc. 2011 Third World Congress on Nature and Biologically Inspired Computing (Salamanca, Spain, 2011), pp. 633–640 (2011). J. C. Bansal, P. K. Singh, M. Saraswat, A. Verma, S. S. Jadon, and A. Abraham, “Inertia Weight strategies in Particle Swarm Optimization,” in Proc. 2011 Third World Congress on Nature and Biologically Inspired Computing (Salamanca, Spain, 2011), pp. 633–640 (2011).
49.
go back to reference R. Caponetto, L. Fortuna, S. Fazzino, and M. G. Xibilia, “Chaotic sequences to improve the performance of evolutionary algorithms,” IEEE Trans. Evol. Comput. 7 (3), 289–304 (2003).CrossRef R. Caponetto, L. Fortuna, S. Fazzino, and M. G. Xibilia, “Chaotic sequences to improve the performance of evolutionary algorithms,” IEEE Trans. Evol. Comput. 7 (3), 289–304 (2003).CrossRef
51.
go back to reference K. G. Dhal, Md. I. Quraishi, and S. Das, “Development of firefly algorithm via chaotic sequence and population diversity to enhance the image contrast,” Nat. Comput. 15 (2), 307–318 (2016).MathSciNetCrossRefMATH K. G. Dhal, Md. I. Quraishi, and S. Das, “Development of firefly algorithm via chaotic sequence and population diversity to enhance the image contrast,” Nat. Comput. 15 (2), 307–318 (2016).MathSciNetCrossRefMATH
52.
go back to reference X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Trans. Evol. Comput. 3 (2), 82–102 (1999).CrossRef X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Trans. Evol. Comput. 3 (2), 82–102 (1999).CrossRef
53.
go back to reference R. Wang, Y. Zhou, C. Zhao, and H. Wu, “A hybrid flower pollination algorithm based modified randomized location for multithreshold medical image segmentation,” Bio-Med. Mater. Eng. 26 (s1), S1345–S1351 (2015).CrossRef R. Wang, Y. Zhou, C. Zhao, and H. Wu, “A hybrid flower pollination algorithm based modified randomized location for multithreshold medical image segmentation,” Bio-Med. Mater. Eng. 26 (s1), S1345–S1351 (2015).CrossRef
54.
go back to reference K. G. Dhal and S. Das, S, “Diversity conserved chaotic Artificial Bee Colony algorithm based brightness preserved histogram equalization and contrast stretching method,” Int. J. Nat. Comput. Res. (IJNCR) 5 (4), 45–73 (2015).CrossRef K. G. Dhal and S. Das, S, “Diversity conserved chaotic Artificial Bee Colony algorithm based brightness preserved histogram equalization and contrast stretching method,” Int. J. Nat. Comput. Res. (IJNCR) 5 (4), 45–73 (2015).CrossRef
55.
go back to reference I. Saha, U. Maulik, and D. Plewczynski, “A new multi-objective technique for differential fuzzy clustering,” Appl. Soft Comput. 11 (2), 2765–2776 (2011).CrossRef I. Saha, U. Maulik, and D. Plewczynski, “A new multi-objective technique for differential fuzzy clustering,” Appl. Soft Comput. 11 (2), 2765–2776 (2011).CrossRef
56.
go back to reference N. Jardine, and R. Sibson, Mathematical Taxonomy (Wiley, New York, 1971).MATH N. Jardine, and R. Sibson, Mathematical Taxonomy (Wiley, New York, 1971).MATH
57.
go back to reference K. Y. Yeung, and W. L. Ruzzo, “Principal component analysis for clustering gene expression data,” Bioinf. 17 (9), 763–774 (2001).CrossRef K. Y. Yeung, and W. L. Ruzzo, “Principal component analysis for clustering gene expression data,” Bioinf. 17 (9), 763–774 (2001).CrossRef
58.
go back to reference S. Park, D. Sargent, R. Lieberman, and U. Gustafsson, “Domain-specific image analysis for cervical neoplasia detection based on conditional random fields,” IEEE Trans. Med. Imag. 30 (3), 867–878 (2011).CrossRef S. Park, D. Sargent, R. Lieberman, and U. Gustafsson, “Domain-specific image analysis for cervical neoplasia detection based on conditional random fields,” IEEE Trans. Med. Imag. 30 (3), 867–878 (2011).CrossRef
59.
go back to reference Y. Xu, J.-Y. Zhu, E. I.-C. Chang, M. Laid, and Z. Tu, “Weakly supervised histopathology cancer image segmentation and classification,” Med. Image Anal. 18 (3), 591–604 (2014).CrossRef Y. Xu, J.-Y. Zhu, E. I.-C. Chang, M. Laid, and Z. Tu, “Weakly supervised histopathology cancer image segmentation and classification,” Med. Image Anal. 18 (3), 591–604 (2014).CrossRef
60.
go back to reference M. N. Gurcan, L. E. Boucheron, A. Can, A. Madabhush, N. M. Rajpoot, and B. Yener, “Histopathological image analysis: A review,” IEEE Rev. Biomed. Eng. 2, 147–171 (2009).CrossRef M. N. Gurcan, L. E. Boucheron, A. Can, A. Madabhush, N. M. Rajpoot, and B. Yener, “Histopathological image analysis: A review,” IEEE Rev. Biomed. Eng. 2, 147–171 (2009).CrossRef
61.
go back to reference M. M. R. Krishnan, P. Shah, C. Chakraborty, and A. K. Ray, “Statistical analysis of textural features for improved classification of oral histopathological images,” J. Med. Syst. 36 (2), 865–881 (2012).CrossRef M. M. R. Krishnan, P. Shah, C. Chakraborty, and A. K. Ray, “Statistical analysis of textural features for improved classification of oral histopathological images,” J. Med. Syst. 36 (2), 865–881 (2012).CrossRef
62.
go back to reference Z. Pan (Department of Pathology, University of Colorado Denver), Enjoy Pathology at http://www.enjoypath.com/ Z. Pan (Department of Pathology, University of Colorado Denver), Enjoy Pathology at http://​www.​enjoypath.​com/​
Metadata
Title
A Clustering Based Classification Approach Based on Modified Cuckoo Search Algorithm
Authors
Krishna Gopal Dhal
Arunita Das
Swarnajit Ray
Sanjoy Das
Publication date
01-07-2019
Publisher
Pleiades Publishing
Published in
Pattern Recognition and Image Analysis / Issue 3/2019
Print ISSN: 1054-6618
Electronic ISSN: 1555-6212
DOI
https://doi.org/10.1134/S1054661819030052

Other articles of this Issue 3/2019

Pattern Recognition and Image Analysis 3/2019 Go to the issue

REPRESENTATION, PROCESSING, ANALYSIS, AND UNDERSTANDING OF IMAGES

Adaptive Detection of Normal Mixture Signals with Pre-Estimated Gaussian Mixture Noise

REPRESENTATION, PROCESSING, ANALYSIS, AND UNDERSTANDING OF IMAGES

Algebraic Interpretation of Image Analysis Operations

REPRESENTATION, PROCESSING, ANALYSIS, AND UNDERSTANDING OF IMAGES

The Stability and Noise Tolerance of Cartesian Zernike Moments Invariants

Premium Partner