<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232022000600638</article-id>
<article-id pub-id-type="doi">10.22201/icat.24486736e.2022.20.6.1077</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Clustering algorithms with prediction of the optimal number of clusters]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Agárdi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Kovács]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,The University of Miskolc  ]]></institution>
<addr-line><![CDATA[Miskolc Egyetemváros]]></addr-line>
<country>Hungary</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2022</year>
</pub-date>
<volume>20</volume>
<numero>6</numero>
<fpage>638</fpage>
<lpage>651</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232022000600638&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232022000600638&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232022000600638&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract Clustering is a widely used technique for grouping of objects. The objects, which are similar to each other, should be in the same cluster. One disadvantage of general clustering algorithms is that the user must specify the number of clusters in advance, as input parameter. This is a major drawback since it is possible that the user cannot specify the number of clusters correctly, and the algorithm thus creates a clustering that puts very different elements into the same cluster. The aim of this paper is to present our representation and evaluation technique to determine the optimal cluster count automatically. With this technique, the algorithms themselves determine the number of clusters. In this paper, first, the classical clustering algorithms are introduced; then, the construction and improvement algorithms and then our representation and evaluation method are presented. Then the performance of the algorithms with the test results are compared.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[clustering]]></kwd>
<kwd lng="en"><![CDATA[optimal number of clusters]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chang]]></surname>
<given-names><![CDATA[C. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Simulated annealing clustering of Chinese words for contextual text recognition]]></article-title>
<source><![CDATA[Pattern Recognition Letters]]></source>
<year>1996</year>
<volume>17</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>57-66</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[C. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Ye]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Particle swarm optimization algorithm and its application to clustering analysis]]></source>
<year>2012</year>
<conf-name><![CDATA[ 17thConference on Electrical Power Distribution]]></conf-name>
<conf-date>2012</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chiu]]></surname>
<given-names><![CDATA[C. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Kuo]]></surname>
<given-names><![CDATA[I. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Ku]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An intelligent market segmentation system using k-means and particle swarm optimization]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2009</year>
<volume>36</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>4558-65</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cui]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Potok]]></surname>
<given-names><![CDATA[T. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Palathingal]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Document clustering using particle swarm optimization]]></source>
<year>2005</year>
<conf-name><![CDATA[ 2005 IEEE Swarm Intelligence Symposium]]></conf-name>
<conf-date>2005</conf-date>
<conf-loc> </conf-loc>
<page-range>185-91</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Doval]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Mancoridis]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mitchell]]></surname>
<given-names><![CDATA[B. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Automatic clustering of software systems using a genetic algorithm]]></source>
<year>1999</year>
<conf-name><![CDATA[ NinthInternational Workshop Software Technology and Engineering Practice]]></conf-name>
<conf-loc> </conf-loc>
<page-range>73-81</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[El Rhazi]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pierre]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tabu search algorithm for cluster building in wireless sensor networks]]></article-title>
<source><![CDATA[IEEE Transactions on Mobile Computing]]></source>
<year>2008</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>433-44</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Forsati]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahdavi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kangavari]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Safarkhani]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Web page clustering using harmony search optimization]]></source>
<year>2008</year>
<conf-name><![CDATA[ Canadian Conference on Electrical and Computer Engineering]]></conf-name>
<conf-date>2008</conf-date>
<conf-loc> </conf-loc>
<page-range>001601-4</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[França]]></surname>
<given-names><![CDATA[P. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sosa]]></surname>
<given-names><![CDATA[N. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pureza]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An adaptive tabu search algorithm for the capacitated clustering problem]]></article-title>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>1999</year>
<volume>6</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>665-78</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fränti]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Sieranoja]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[K-means properties on six clustering benchmark datasets]]></article-title>
<source><![CDATA[Applied Intelligence]]></source>
<year>2014</year>
<volume>48</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>4743-59</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheng]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Inazumi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant colony optimization with clustering for solving the dynamic location routing problem]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2016</year>
<volume>285</volume>
<page-range>149-73</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Glover]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Laguna]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tabu search]]></article-title>
<source><![CDATA[Handbook of combinatorial optimization]]></source>
<year>1998</year>
<page-range>2093-229</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Golden]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Bodin]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Doyle]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Stewart Jr]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximate traveling salesman algorithms]]></article-title>
<source><![CDATA[Operations research]]></source>
<year>1980</year>
<volume>28</volume>
<numero>3-part-ii</numero>
<issue>3-part-ii</issue>
<page-range>694-711</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoang]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yadav]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Panda]]></surname>
<given-names><![CDATA[S. K.]]></given-names>
</name>
</person-group>
<source><![CDATA[A robust harmony search algorithm-based clustering protocol for wireless sensor networks]]></source>
<year>2010</year>
<conf-name><![CDATA[ IEEE International Conference on Communications Workshops]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc> </conf-loc>
<page-range>1-5</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoang]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yadav]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Panda]]></surname>
<given-names><![CDATA[S. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Real-time implementation of a harmony search algorithm-based clustering protocol for energy-efficient wireless sensor networks]]></article-title>
<source><![CDATA[IEEE transactions on industrial informatics]]></source>
<year>2013</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>774-83</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hruschka]]></surname>
<given-names><![CDATA[E. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ebecken]]></surname>
<given-names><![CDATA[N. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for cluster analysis]]></article-title>
<source><![CDATA[Intelligent Data Analysis]]></source>
<year>2003</year>
<volume>7</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>15-25</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kalyani]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Swarup]]></surname>
<given-names><![CDATA[K. S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Particle swarm optimization based K-means clustering approach for security assessment in power systems]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2011</year>
<volume>38</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>10839-46</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kinney]]></surname>
<given-names><![CDATA[G. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Barnes]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Colletti]]></surname>
<given-names><![CDATA[B. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A reactive tabu search algorithm with variable clustering for the unicost set covering problem]]></article-title>
<source><![CDATA[International Journal of Operational Research]]></source>
<year>2007</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>156-72</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kudova]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Clustering genetic algorithm]]></source>
<year>2007</year>
<conf-name><![CDATA[ 18thInternational Workshop on Database and Expert Systems Applications (DEXA 2007)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>138-42</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lazzerini]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Marcelloni]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for generating optimal assembly plans]]></article-title>
<source><![CDATA[Artificial Intelligence in Engineering]]></source>
<year>2000</year>
<volume>14</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>319-29</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[A clustering particle swarm optimizer for dynamic optimization]]></source>
<year>2009</year>
<conf-name><![CDATA[ IEEE Congress on Evolutionary Computation]]></conf-name>
<conf-date>2009</conf-date>
<conf-loc> </conf-loc>
<page-range>439-46</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Fotouhi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Brown]]></surname>
<given-names><![CDATA[S. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[FGKA: A fast genetic k-means clustering algorithm]]></source>
<year>2004</year>
<conf-name><![CDATA[ ACM symposium on Applied computing]]></conf-name>
<conf-date>2004</conf-date>
<conf-loc> </conf-loc>
<page-range>622-3</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Madhuri]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Murty]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Murthy]]></surname>
<given-names><![CDATA[J. V. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Reddy]]></surname>
<given-names><![CDATA[P. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Satapathy]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Cluster analysis on different data sets using K-modes and K-prototype algorithms]]></source>
<year>2014</year>
<volume>II</volume>
<conf-name><![CDATA[ 48thAnnual Convention of Computer Society of India]]></conf-name>
<conf-loc> </conf-loc>
<page-range>137-44</page-range><publisher-loc><![CDATA[Cham. ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahdavi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Abolhassani]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Harmony K-means algorithm for document clustering]]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>2009</year>
<volume>18</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>370-91</page-range></nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Maulik]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Bandyopadhyay]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Genetic algorithm-based clustering technique]]></article-title>
<source><![CDATA[Pattern recognition]]></source>
<year>2000</year>
<volume>33</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1455-65</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Milano]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Koumoutsakos]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A clustering genetic algorithm for cylinder drag optimization]]></article-title>
<source><![CDATA[Journal of Computational Physics]]></source>
<year>2002</year>
<volume>175</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>79-107</page-range></nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murtagh]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of recent advances in hierarchical clustering algorithms]]></article-title>
<source><![CDATA[The Computer Journal]]></source>
<year>1983</year>
<volume>26</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>354-9</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murty]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Murthy]]></surname>
<given-names><![CDATA[J. V. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Reddy]]></surname>
<given-names><![CDATA[P. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Naik]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Satapathy]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Homogeneity separateness: a new validity measure for clustering problems]]></source>
<year>2014</year>
<volume>I</volume>
<conf-name><![CDATA[ 48thAnnual Convention of Computer Society of India]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-10</page-range><publisher-loc><![CDATA[Cham. ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murty]]></surname>
<given-names><![CDATA[M. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Naik]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Murthy]]></surname>
<given-names><![CDATA[J. V. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Reddy]]></surname>
<given-names><![CDATA[P. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Satapathy]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Parvathi]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automatic clustering using teaching learning based optimization]]></article-title>
<source><![CDATA[Applied Mathematics]]></source>
<year>2014</year>
<volume>5</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1202-11</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nilsson]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Heuristics for the traveling salesman problem]]></source>
<year>2003</year>
<numero>38</numero>
<issue>38</issue>
<page-range>00085-9</page-range><publisher-name><![CDATA[Linkoping University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Olson]]></surname>
<given-names><![CDATA[C. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Parallel algorithms for hierarchical clustering]]></article-title>
<source><![CDATA[Parallel computing]]></source>
<year>1995</year>
<volume>21</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>1313-25</page-range></nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Omran]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Salman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Image classification using particle swarm optimization]]></article-title>
<source><![CDATA[Recent advances in simulated evolution and learning]]></source>
<year>2004</year>
<page-range>347-65</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Omran]]></surname>
<given-names><![CDATA[M. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Salman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Dynamic clustering using particle swarm optimization with application in image segmentation]]></article-title>
<source><![CDATA[Pattern Analysis and Applications]]></source>
<year>2006</year>
<volume>8</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>332</page-range></nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osman]]></surname>
<given-names><![CDATA[I. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Christofides]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Capacitated clustering problems by hybrid simulated annealing and tabu search]]></article-title>
<source><![CDATA[International Transactions in Operational Research]]></source>
<year>1994</year>
<volume>1</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>317-36</page-range></nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Paoli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Melgani]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pasolli]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Clustering of hyperspectral images based on multiobjective particle swarm optimization]]></article-title>
<source><![CDATA[IEEE transactions on geoscience and remote sensing]]></source>
<year>2009</year>
<volume>47</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>4175-88</page-range></nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosenkrantz]]></surname>
<given-names><![CDATA[D. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Stearns]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lewis]]></surname>
<given-names><![CDATA[P. M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximate algorithms for the traveling salesperson problem]]></source>
<year>1974</year>
<conf-name><![CDATA[ 15thAnnual Symposium on Switching and Automata Theory (SWAT]]></conf-name>
<conf-date>1974</conf-date>
<conf-loc> </conf-loc>
<page-range>33-42</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Runkler]]></surname>
<given-names><![CDATA[T. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ant colony optimization of clustering models]]></article-title>
<source><![CDATA[International Journal of Intelligent Systems]]></source>
<year>2005</year>
<volume>20</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>1233-51</page-range></nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scheunders]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic c-means clustering algorithm applied to color image quantization]]></article-title>
<source><![CDATA[Pattern recognition]]></source>
<year>1997</year>
<volume>30</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>859-66</page-range></nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shelokar]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Jayaraman]]></surname>
<given-names><![CDATA[V. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Kulkarni]]></surname>
<given-names><![CDATA[B. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An ant colony approach for clustering]]></article-title>
<source><![CDATA[Analytica Chimica Acta]]></source>
<year>2004</year>
<volume>509</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>187-95</page-range></nlm-citation>
</ref>
<ref id="B39">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Starkweather]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[McDaniel]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Mathias]]></surname>
<given-names><![CDATA[K. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Whitley]]></surname>
<given-names><![CDATA[L. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Whitley]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Comparison of Genetic Sequencing Operators]]></source>
<year>1991</year>
<page-range>69-76</page-range><publisher-name><![CDATA[ICGA]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B40">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Van der Merwe]]></surname>
<given-names><![CDATA[D. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Engelbrecht]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data clustering using particle swarm optimization]]></source>
<year>2003</year>
<conf-name><![CDATA[ The 2003 Congress on Evolutionary Computation]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc> </conf-loc>
<page-range>215-20</page-range></nlm-citation>
</ref>
<ref id="B41">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wagstaff]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Cardie]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rogers]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Schrödl]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constrained k-means clustering with background knowledge]]></source>
<year>2001</year>
<volume>1</volume>
<conf-name><![CDATA[ Eighteenth International Conference on Machine Learning]]></conf-name>
<conf-loc> </conf-loc>
<page-range>577-84</page-range></nlm-citation>
</ref>
<ref id="B42">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[K. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[C. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Pang]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Particle swarm optimization for traveling salesman problem]]></source>
<year>2003</year>
<conf-name><![CDATA[ International Conference on Machine Learning and Cybernetics]]></conf-name>
<conf-date>2003</conf-date>
<conf-loc> </conf-loc>
<page-range>1583-5</page-range></nlm-citation>
</ref>
<ref id="B43">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[An improved index for clustering validation based on Silhouette index and Calinski-Harabasz index]]></source>
<year>2019</year>
<volume>569</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>052024</page-range></nlm-citation>
</ref>
<ref id="B44">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Whitley]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm tutorial]]></article-title>
<source><![CDATA[Statistics and computing]]></source>
<year>1994</year>
<volume>4</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>65-85</page-range></nlm-citation>
</ref>
<ref id="B45">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Chu]]></surname>
<given-names><![CDATA[C. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Yan]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A genetic algorithm for cellular manufacturing design and layout]]></article-title>
<source><![CDATA[European journal of operational research]]></source>
<year>2007</year>
<volume>181</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>156-67</page-range></nlm-citation>
</ref>
<ref id="B46">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Wunsch]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Survey of clustering algorithms]]></article-title>
<source><![CDATA[IEEE Transactions on neural networks]]></source>
<year>2005</year>
<volume>16</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>645-78</page-range></nlm-citation>
</ref>
<ref id="B47">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Xu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A multipath routing protocol based on clustering and ant colony optimization for wireless sensor networks]]></article-title>
<source><![CDATA[Sensors]]></source>
<year>2010</year>
<volume>10</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>4521-40</page-range></nlm-citation>
</ref>
<ref id="B48">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Mao]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Image segmentation based on ant colony optimization and K-means clustering]]></source>
<year>2007</year>
<conf-name><![CDATA[ IEEE International Conference on Automation and Logistics]]></conf-name>
<conf-date>2007</conf-date>
<conf-loc> </conf-loc>
<page-range>459-63</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
