<?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-55462006000100002</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Formation of Resemblance Measures Among Sets]]></article-title>
<article-title xml:lang="es"><![CDATA[Formación de Medidas de Equivalencia entre Conjuntos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[Otar]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Khurodze]]></surname>
<given-names><![CDATA[Ramaz]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[Lasha]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,University of GTU Artificial Intelligence Departament ]]></institution>
<addr-line><![CDATA[Georgia Tbilisi]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2006</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2006</year>
</pub-date>
<volume>9</volume>
<numero>3</numero>
<fpage>191</fpage>
<lpage>202</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462006000100002&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-55462006000100002&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-55462006000100002&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[In this paper it is described a method to compute the distance between sets, that implies the formation of distance functions different from Hausdorff metric. Two functions with metric properties, which describe quantitatively distances between sets, are formed. First function can be used for sets arbitrary situated from each other. Second distance is more suited for sets clustered by rank links. For reconstructing the metric functions, we define the so-called boundary points between sets. This allows to defining the minimal and the maximal distances between them, which represents the arguments for the formed metric functions. This also allows quantitatively estimate in amore complete way the isolation degree between given sets.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[En este artículo se describe un método para el cálculo de la lejanía entre conjuntos. Esto implica la formación de funciones distancia pero diferentes a la métrica de Hausdorff. Se forman dos clases de funciones con propiedades métricas, que describen cualitativamente distancias entre conjuntos. La primera función puede ser usada para conjuntos arbitrariamente situados entre ellos. La segunda función es más aplicable para conjuntos que pueden ser acumulados a través del método de "Rank Links". Para re-construir las funciones métricas, se definen los llamados puntos de la frontera entre conjuntos. Esto permite definir distancias mínimas y máximas entre ellos, lo que representa sus argumentos. También, esto permite estimar cuánticamente de firma más completa el índice de separación entre ellos.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Clusterization]]></kwd>
<kwd lng="en"><![CDATA[Metric Functions]]></kwd>
<kwd lng="en"><![CDATA[Pattern Recognition]]></kwd>
<kwd lng="es"><![CDATA[Clusterización]]></kwd>
<kwd lng="es"><![CDATA[Funciones de medida]]></kwd>
<kwd lng="es"><![CDATA[Reconocimiento de patrones]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><b>Formation of Resemblance Measures Among Sets</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><i>Formaci&oacute;n de Medidas de Equivalencia entre Conjuntos</i></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Otar Verulava, Ramaz Khurodze and Lasha Verulava.</b></font></p>     <p align="center"><font face="verdana" size="2"><i>Artificial Intelligence Departament    <br> University of GTU    <br> Georgia, Tbilisi</i>    ]]></body>
<body><![CDATA[<br> <a href="mailto:verulava@gtu.ge">verulava@gtu.ge</a></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><u>Article received on February 2, 2005; accepted on June 22, 2005</u></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>     <p align="justify"><font face="verdana" size="2">In this paper it is described a method to compute the distance between sets, that implies the formation of distance functions different from Hausdorff metric. Two functions with metric properties, which describe quantitatively distances between sets, are formed. First function can be used for sets arbitrary situated from each other. Second distance is more suited for sets clustered by rank links. For reconstructing the metric functions, we define the so&#150;called boundary points between sets. This allows to defining the minimal and the maximal distances between them, which represents the arguments for the formed metric functions. This also allows quantitatively estimate in amore complete way the isolation degree between given sets.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords: </b>Clusterization, Metric Functions, Pattern Recognition.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>     <p align="justify"><font face="verdana" size="2">En este art&iacute;culo se describe un m&eacute;todo para el c&aacute;lculo de la lejan&iacute;a entre conjuntos. Esto implica la formaci&oacute;n de funciones distancia pero diferentes a la m&eacute;trica de Hausdorff. Se forman dos clases de funciones con propiedades m&eacute;tricas, que describen cualitativamente distancias entre conjuntos. La primera funci&oacute;n puede ser usada para conjuntos arbitrariamente situados entre ellos. La segunda funci&oacute;n es m&aacute;s aplicable para conjuntos que pueden ser acumulados a trav&eacute;s del m&eacute;todo de "Rank Links". Para re&#150;construir las funciones m&eacute;tricas, se definen los llamados puntos de la frontera entre conjuntos. Esto permite definir distancias m&iacute;nimas y m&aacute;ximas entre ellos, lo que representa sus argumentos. Tambi&eacute;n, esto permite estimar cu&aacute;nticamente de firma m&aacute;s completa el &iacute;ndice de separaci&oacute;n entre ellos.</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>Palabras clave: </b>Clusterizaci&oacute;n, Funciones de medida, Reconocimiento de patrones.</font></p>     <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v9n3/v9n3a2.pdf" target="_blank">DESCARGA ARTICULO EN FORMATO PDF</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">1. <b>Verulava O.,</b> Clustering analysis by "Rank of Links"<sup></sup>. <i>Transactions of Georgian Technical University, Tbilisi, </i>#3 (414), 288&#150;296, 1997.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050331&pid=S1405-5546200600010000200001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">2. <b>Verulava  O.  and  R.  Khurodze,   </b>Clustering Analysis and Decision&#150;making by "Rank of Links<sup>"</sup>. <i>Mathematical Problems in Enginering, </i>vol. 8(4&#150;5), 475&#150;492, 2002.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050332&pid=S1405-5546200600010000200002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">3. <b>Verulava O. and R. Khurodze, </b>"The Principles of Pattern Recognition Theory<sup>"</sup>. Georgian Technical University, Tbilisi, 2001. (in Georgian).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050333&pid=S1405-5546200600010000200003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">4. <b>Faure A.,</b> Perception and Pattern Recognition. Editests, 1985.(in French).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050334&pid=S1405-5546200600010000200004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">5. <b>Jain A. K. and R. C. Dubes, </b>Algorithms for clustering data. Prentice Hall, 1988.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050335&pid=S1405-5546200600010000200005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">6. Classification and Clustering. Edited by J. Van Risin, Academic Press, 1977.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050336&pid=S1405-5546200600010000200006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">7. <b>Verulava O. and R. Khurodze, </b>Theory of Rank of Links &#150; Modeling and Recognition Process. Georgian Technical University, Tbilisi, 2004. (in Georgian).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2050337&pid=S1405-5546200600010000200007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<source><![CDATA[Clustering analysis by "Rank of Links"]]></source>
<year>1997</year>
<page-range>288-296</page-range><publisher-loc><![CDATA[Tbilisi ]]></publisher-loc>
<publisher-name><![CDATA[Transactions of Georgian Technical University414]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Khurodze]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Clustering Analysis and Decision-making by "Rank of Links]]></article-title>
<source><![CDATA[Mathematical Problems in Enginering]]></source>
<year>2002</year>
<volume>8</volume>
<numero>4-5</numero>
<issue>4-5</issue>
<page-range>475-492</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Khurodze]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[The Principles of Pattern Recognition Theory]]></source>
<year>2001</year>
<publisher-loc><![CDATA[Tbilisi ]]></publisher-loc>
<publisher-name><![CDATA[Georgian Technical University]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Faure]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Perception and Pattern Recognition]]></source>
<year>1985</year>
<publisher-name><![CDATA[Editests]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</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-name><![CDATA[Prentice Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Van Risin]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Classification and Clustering]]></source>
<year>1977</year>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verulava]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Khurodze]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Theory of Rank of Links - Modeling and Recognition Process]]></source>
<year>2004</year>
<publisher-loc><![CDATA[Tbilisi ]]></publisher-loc>
<publisher-name><![CDATA[Georgian Technical University]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
