Modified Teacher Learning Based Optimization Method for Data Clustering

Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 264)


Clustering is an important task in engineering domain which can be applied in many applications. Clustering is a process to group the data items in the form of clusters such that data items in one cluster have more similarity to other clusters. On the other side, Teaching–Learning Based Optimization (TLBO) algorithm is a latest population based optimization technique that has been effectively applied to solve mechanical design problems and also utilized to solve clustering problem. This algorithm is based on unique ability of teacher i.e. how the teacher influence the learners through its teaching skills. This algorithm has shown good potential to solve clustering problems but it is still suffering with some problems. In this paper, two modifications have been proposed for TLBO method to enhance its performance in clustering domain instead of random initialization a predefined method previously used to exploit initial cluster centers as well as to deal the data vectors that cross the boundary condition. The performance of proposed modified TLBO algorithm is evaluated with six dataset using quantization error, intra cluster distance and inters cluster distance parameters and compared with K-Means, Particle Swarm Optimization (PSO) and TLBO. From the experimental results, it is clearly obvious that the proposed modifications have shown better results as compared to previously ones.


Clustering K-Means PSO TLBO 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Garey, M.R., Johnson, D., Witsenhausen, H.: The complexity of the generalized Lloyd-max problem. IEEE Transactions on Information Theory 28(2), 255–256 (1982)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Karaboga, D.: An idea based on honey bee swarm for numerical optimization, technical report-TR06, Erciyes University, Engineering Faculty, Computer Eng. Dep. (2005)Google Scholar
  3. 3.
    Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artificial Life 5(2), 137–172 (1999)CrossRefGoogle Scholar
  4. 4.
    Holland, J.H.: Adaption in natural and artificial systems (1975)Google Scholar
  5. 5.
    Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc. of IEEE international Conference on Neural Networks (ICW), Perth, Australia, vol. IV, pp. 1942–1948 (1995); Santosa, B., Ningrum, M.K.: Cat swarm optimization for clustering. In: International Conference on Soft Computing and Pattern Recognition (SOCPAR 2009), pp. 54–59 (2009)Google Scholar
  6. 6.
    Hatamlou, A.: Black hole: A new heuristic optimization approach for data clustering. Information Sciences 222, 175–184 (2013)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Chu, S.-C., Tsai, P.-w., Pan, J.-S.: Cat swarm optimization. In: Yang, Q., Webb, G. (eds.) PRICAI 2006. LNCS (LNAI), vol. 4099, pp. 854–858. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: GSA: a gravitational search algorithm. Information Sciences 179(13), 2232–2248 (2009)CrossRefMATHGoogle Scholar
  9. 9.
    Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design 43(3), 303–315 (2011)CrossRefGoogle Scholar
  10. 10.
    MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1(281-297), p. 14 (1967)Google Scholar
  11. 11.
    Satapathy, S.C., Naik, A.: Data clustering based on teaching-learning-based optimization. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds.) SEMCCO 2011, Part II. LNCS, vol. 7077, pp. 148–156. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  12. 12.
    Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching–learning-based optimization: an optimization method for continuous non-linear large scale problems. Information Sciences 183(1), 1–15 (2012)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Infosys TechnologiesChennaiIndia
  2. 2.Department of Information TechnologyBirla Institute of Technology, MesraRanchiIndia

Personalised recommendations