<?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-55462022000100071</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-1-4153</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Permutation Based Algorithm Improved by Classes for Similarity Searching]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[Karina]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Camarena-Ibarrola]]></surname>
<given-names><![CDATA[Antonio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Valero]]></surname>
<given-names><![CDATA[Luis]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Michoacana de San Nicolás de Hidalgo Facultad de Ciencias Físico Matemáticas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Michoacana de San Nicolás de Hidalgo Facultad de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>1</numero>
<fpage>71</fpage>
<lpage>79</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000100071&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-55462022000100071&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-55462022000100071&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Similarity searching is the most important task in multimedia databases, It consists in retrieving the most similar elements to a given query from a database, knowing that an element identical to the query would not be found. Dissimilarity between objects is measured with a distance function (usually expensive to compute), this allows approaching this problem with a metric space. Many algorithms have been designed to address this problem, in particular, the Permutation Based index has shown an unbeatable performance. This technique uses reference objects to determine a string for each element in the database that is a permutation of the same string. However, Huge databases and the memory required for these indexes make this problem a real challenge. In this paper, we present an improvement to the first approach where classes of reference objects were used instead of single references. In this paper, a new way to choose these classes is proposed and a new way to evaluate similarity between permutations. Our experiments show that we can avoid distance evaluations up to 90% with respect to the original technique, and up to 80% to the first approach.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Similarity searching]]></kwd>
<kwd lng="en"><![CDATA[metric spaces]]></kwd>
<kwd lng="en"><![CDATA[pattern recognition]]></kwd>
<kwd lng="en"><![CDATA[nearest neighbor]]></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[Amato]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Savino]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approximate similarity search in metric spaces using inverted files]]></article-title>
<source><![CDATA[Infoscale]]></source>
<year>2008</year>
<page-range>28</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baeza-Yates]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Cunto]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Manber]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proximity matching using fixed-queries trees]]></source>
<year>1994</year>
<conf-name><![CDATA[ CPM]]></conf-name>
<conf-loc> </conf-loc>
<page-range>198-212</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bolettieri]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Esuli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Falchi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Lucchese]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Perego]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Piccioli]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Rabitti]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[CoPhIR: a test collection for content-based image retrieval]]></source>
<year>2009</year>
<volume>abs/0905.4627v2</volume>
<publisher-name><![CDATA[CoRR]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brisaboa]]></surname>
<given-names><![CDATA[N. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Fariña]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pedreira]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Similarity search using sparse pivots for efficient multimedia information retrieval]]></source>
<year>2006</year>
<conf-name><![CDATA[ 8th IEEE International Symposium on Multimedia (ISM&#8217;06)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>881-8</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chávez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Proximity searching in high dimensional spaces with a proximity preserving order. MICAI 2005: Advances in Artificial Intelligence]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2005</year>
<volume>3789</volume>
<page-range>405-14</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chávez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Effective proximity retrieval by ordering permutations]]></article-title>
<source><![CDATA[IEEE Trans. on Pattern Analysis and Machine Intelligence]]></source>
<year>2008</year>
<volume>30</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1647-58</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chávez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A compact space decomposition for effective metric indexing]]></article-title>
<source><![CDATA[Pattern Recognit. Lett.]]></source>
<year>2005</year>
<volume>26</volume>
<page-range>1363-76</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chávez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Baeza-Yates]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Marroquín]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Searching in metric spaces]]></article-title>
<source><![CDATA[ACM Computing Surveys]]></source>
<year>2001</year>
<volume>33</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>273-321</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Das]]></surname>
<given-names><![CDATA[A. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Bhuyan]]></surname>
<given-names><![CDATA[P. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Self-organizing tree algorithm (sota) clustering for defining level of service (los) criteria of urban streets]]></article-title>
<source><![CDATA[Periodica Polytechnica Transportation Engineering]]></source>
<year>2019</year>
<volume>47</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>309-17</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Esuli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[MiPai: using the PP-Index to build an efficient and scalable similarity search system]]></source>
<year>2009</year>
<conf-name><![CDATA[ 2nd Intl. Wksp. on Similary Search and Applications (SISAP&#8217;09)]]></conf-name>
<conf-loc> </conf-loc>
<page-range>146-8</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Esuli]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Use of permutation prefixes for efficient and scalable approximate similarity search]]></article-title>
<source><![CDATA[Information Processing &amp; Management]]></source>
<year>2012</year>
<volume>48</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>889-902</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Chávez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Metric spaces library]]></source>
<year>2007</year>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Paredes]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rangel]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient group of permutants for proximity searching]]></source>
<year>2011</year>
<conf-name><![CDATA[ 3rd Mexican Conf. on Pattern Recognition (MCPR&#8217;11), LNCS 6718]]></conf-name>
<conf-loc> </conf-loc>
<page-range>42-9</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Figueroa]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Paredes]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[New permutation dissimilarity measures for proximity searching]]></source>
<year>2018</year>
<volume>11223</volume>
<conf-name><![CDATA[ LNCS]]></conf-name>
<conf-loc> </conf-loc>
<page-range>122-33</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hjaltason]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Index-driven similarity search in metric spaces]]></article-title>
<source><![CDATA[ACM Transactions Database Systems]]></source>
<year>2003</year>
<volume>28</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>517-80</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kalantari]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[McDonald]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A data structure and an algorithm for the nearest point problem]]></article-title>
<source><![CDATA[IEEE Transactions on Software Engineering]]></source>
<year>1983</year>
<volume>SE-9</volume>
<page-range>631-4</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mamede]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Recursive lists of clusters: A dynamic data structure for range queries in metric spaces]]></source>
<year>2005</year>
<volume>3733</volume>
<conf-name><![CDATA[ LNCS]]></conf-name>
<conf-loc> </conf-loc>
<page-range>843-53</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mohamed]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Marchand-Maillet]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantized ranking for permutation-based indexing]]></article-title>
<source><![CDATA[Information Systems]]></source>
<year>2015</year>
<volume>52</volume>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Navarro]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Paredes]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Bustos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An empirical evaluation of intrinsic dimension estimators]]></article-title>
<source><![CDATA[Information Systems]]></source>
<year>2017</year>
<volume>64</volume>
<page-range>206-18</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Novak]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Zezula]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[PPP-codes for large-scale similarity searching]]></source>
<year>2016</year>
<conf-name><![CDATA[ TLDKS XXIV]]></conf-name>
<conf-loc> </conf-loc>
<page-range>61-87</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Samet]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Foundations of Multidimensional and Metric Data Structures]]></source>
<year>2006</year>
<publisher-name><![CDATA[Morgan Kaufmann]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vadicamo]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Connor]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Falchi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Gennaro]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Rabitti]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Splx-perm: A novel permutation-based representation for approximate metric search]]></article-title>
<collab>LNCS</collab>
<source><![CDATA[Similarity Search and Applications]]></source>
<year>2019</year>
<volume>11807</volume>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zezula]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Amato]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Dohnal]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
<name>
<surname><![CDATA[Batko]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Similarity Search: The Metric Space Approach]]></article-title>
<source><![CDATA[Advances in Database Systems]]></source>
<year>2006</year>
<volume>32</volume>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
