<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462020000200575</article-id>
<article-id pub-id-type="doi">10.13053/cys-24-2-3391</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Survey of Overlapping Clustering Algorithms]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Beltrán]]></surname>
<given-names><![CDATA[Beatriz]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vilariño]]></surname>
<given-names><![CDATA[Darnes]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Faculty of Computer Science ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<volume>24</volume>
<numero>2</numero>
<fpage>575</fpage>
<lpage>581</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462020000200575&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462020000200575&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462020000200575&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This paper is presented as a study of the overlapping clustering algorithms that have been developed in the last years, researchers have been working on these algorithms in different ways, in some cases they are based on widely known algorithms such as k-means and in others that work with heuristics or graphs. The need to work in clustering algorithms with overlap is due to the fact that currently there are many problems that require that the obtained groups be non-exclusive and for which it gives the guideline for this analysis. The algorithms included in this analysis are: ADditive CLUstering, Overlapping K-means, Dynamic Overlapping Clustering based on Relevance, Overlapping Clustering based on Density and Compactness, MCLC, A tree-based incremental overlapping clustering method, INDCLUS and Hybrid K-means.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Clustering algorithms]]></kwd>
<kwd lng="en"><![CDATA[supervised classification]]></kwd>
<kwd lng="en"><![CDATA[overlapping cluster]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arabie]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Carroll]]></surname>
<given-names><![CDATA[J. D.]]></given-names>
</name>
<name>
<surname><![CDATA[DeSarbo]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wind]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Overlapping clustering: A new method for product positioning]]></article-title>
<source><![CDATA[Journal of Marketing Research]]></source>
<year>1981</year>
<volume>18</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>310-7</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aslam]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelekhov]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rus]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[A practical clustering algorithm for static and dynamic information organization]]></source>
<year>1999</year>
<conf-name><![CDATA[ 1999 Symposium on Discrete Algorithms]]></conf-name>
<conf-loc> </conf-loc>
<page-range>51-60</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aslam]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pelekhov]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rus]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Star Clustering Algorithm For Static And Dynamic Information Organization]]></article-title>
<source><![CDATA[Journal of Graph Algorithms and Applications]]></source>
<year>2004</year>
<volume>8</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>95-129</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cleuziou]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[An extended version of the k-means method for overlapping clustering]]></source>
<year>2008</year>
<conf-name><![CDATA[ 2008 19th International Conference on Pattern Recognition]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-4</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Costa]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Manco]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortale]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An incremental clustering scheme for data de-duplication]]></article-title>
<source><![CDATA[Data Mining and Knowledge Discovery]]></source>
<year>2009</year>
<volume>20</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>152</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Ota]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Finding overlapping communities based on markov chain and link clustering]]></article-title>
<source><![CDATA[Peer-to-Peer Networking and Applications]]></source>
<year>2017</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>411-20</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fisher]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Knowledge acquisition via incremental conceptual clustering]]></article-title>
<source><![CDATA[Machine Learning]]></source>
<year>1987</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>139-72</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[France]]></surname>
<given-names><![CDATA[S. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Adclus and indclus: analysis, experimentation, and meta-heuristic algorithm extensions]]></article-title>
<source><![CDATA[Advances in Data Analysis and Classification]]></source>
<year>2017</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>371-93</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Ma]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data clustering -theory, algorithms, and applications]]></source>
<year>2007</year>
<conf-name><![CDATA[ SIAM]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Fan]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Luo]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Local homogeneous consistent safe semi-supervised clustering]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2018</year>
<volume>97</volume>
<page-range>384-93</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ghosh]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gupta]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Automated hierarchical density shaving: A robust automated clustering and visualization framework for large biological data sets]]></article-title>
<source><![CDATA[IEEE/ACM Transactions on Computational Biology and Bioinformatics]]></source>
<year>2008</year>
<volume>7</volume>
<page-range>223-37</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gilpin]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Davidson]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A flexible ilp formulation for hierarchical clustering]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2017</year>
<volume>244</volume>
<numero>C</numero>
<issue>C</issue>
<page-range>95-109</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hatamlou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Abdullah]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nezamabadi-Pour]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A combined approach for clustering based on k-means and gravitational search algorithms]]></article-title>
<source><![CDATA[Swarm and Evolutionary Computation]]></source>
<year>2012</year>
<volume>6</volume>
<page-range>47-52</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jain]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Dubes]]></surname>
<given-names><![CDATA[R. C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithms for Clustering Data]]></source>
<year>1988</year>
<publisher-loc><![CDATA[Upper Saddle River, NJ, USA ]]></publisher-loc>
<publisher-name><![CDATA[Prentice-Hall, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Khanmohammadi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Adibeig]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Shanehbandy]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved overlapping k-means clustering method for medical applications]]></article-title>
<source><![CDATA[Expert Syst. Appl.]]></source>
<year>2017</year>
<volume>67</volume>
<numero>C</numero>
<issue>C</issue>
<page-range>12-8</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kneser]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ney]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Improved clustering techniques for class-based statistical language modelling]]></source>
<year>1993</year>
<conf-name><![CDATA[ EUROSPEECH]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Patnaik]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Bhuyan]]></surname>
<given-names><![CDATA[P. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[K. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Divisive analysis (diana) of hierarchical clustering and gps data for level of service criteria of urban streets]]></article-title>
<source><![CDATA[Alexandria Engineering Journal]]></source>
<year>2016</year>
<volume>55</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>407-18</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez-Suárez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina-Pagola]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An algorithm based on density and compactness for dynamic overlapping clustering]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2013</year>
<volume>46</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>3040-55</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pérez-Suárez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Trinidad]]></surname>
<given-names><![CDATA[J. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Carrasco-Ochoa]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina-Pagola]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new overlapping clustering algorithm based on graph theory]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Batyrshin]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[González Mendoza]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Artificial Intelligence]]></source>
<year>2013</year>
<page-range>61-72</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer Berlin Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A tree-based incremental overlapping clustering method using the three-way decision theory]]></article-title>
<source><![CDATA[Knowledge-Based Systems]]></source>
<year>2016</year>
<volume>91</volume>
<page-range>189-203</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yu]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaomurilige]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[M.-S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On convergence and parameter selection of the em and da-em algorithms for gaussian mixtures]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2018</year>
<volume>77</volume>
<page-range>188-203</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zamir]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Etzioni]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Web document clustering: A feasibility demonstration]]></source>
<year>1998</year>
<conf-name><![CDATA[ 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR &#8217;98]]></conf-name>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>46-54</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
