<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992021000300153</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Reducción de tamaño en Modelos de Reglas de Asociación: Una revisión sistemática de la literatura]]></article-title>
<article-title xml:lang="en"><![CDATA[Size reduction in Association Rules Models: A systematic literature review]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Diaz Vera]]></surname>
<given-names><![CDATA[Julio César]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Negrín Ortiz]]></surname>
<given-names><![CDATA[Guillermo Manuel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Vila]]></surname>
<given-names><![CDATA[María Amparo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Ciencias Informáticas Facultad 3 ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Jaén  ]]></institution>
<addr-line><![CDATA[ Jaén]]></addr-line>
<country>Spain</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de Granada  ]]></institution>
<addr-line><![CDATA[ Granada]]></addr-line>
<country>Spain</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2021</year>
</pub-date>
<volume>15</volume>
<numero>3</numero>
<fpage>153</fpage>
<lpage>174</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992021000300153&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992021000300153&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992021000300153&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Las Reglas de Asociación constituyen una de las tareas de minería de datos más estudiadas y aplicadas quizás porque su representación hace que sean fácilmente aceptadas e interpretadas por agentes humanos. Su principal debilidad está asociada a la gran cantidad de reglas que son generadas para casos relativamente sencillos y que hacen imposible su análisis manual para determinar cuáles son las reglas relevantes. El objetivo de este trabajo es ejecutar una revisión sistemática de la literatura en el campo de la reducción del tamaño de los modelos de reglas de asociación con vistas a caracterizar y presentar el estado del arte de esta temática e identificar nuevas oportunidades de investigación. El análisis de los resultados muestra que la mayoría de los esfuerzos se enfocan hacia la eliminación de reglas redundantes pero este enfoque se está desplazando desde definiciones de redundancia asociadas a la estructura de las reglas hacia la inclusión del conocimiento de los usuarios dentro del proceso.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Association Rules are one of the most studied and applied techniques in Data Mining. This is because they are easily accepted an interpreted by human agents. Association Rules main handicap is the great cardinality of models that even in simple datasets produce too many rules to be, manually, analyzed by experts in order to find those that are relevant ones. The objective of this paper is to carry out a systematic literature review in the field of size reduction in association rules models, to characterize and present the state of the art of this field. From the analysis of the results, it could be observed that most works focus on redundancy elimination but they are moving from redundancy definition associated to rule structure to redundancy definitions based on user knowledge and preference.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[reglas de asociación]]></kwd>
<kwd lng="es"><![CDATA[reducción de modelos de reglas de asociación]]></kwd>
<kwd lng="es"><![CDATA[revisión sistemática de la literatura]]></kwd>
<kwd lng="en"><![CDATA[association rules]]></kwd>
<kwd lng="en"><![CDATA[size reduction in association rules models]]></kwd>
<kwd lng="en"><![CDATA[systematic literature review]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Taluja]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Bhupal]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Krishnan]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A Survey Paper on DNA-Based Data Storage]]></source>
<year>2020</year>
<page-range>1-4</page-range><publisher-name><![CDATA[Emerging Trends in Information Technology and Engineering: IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tirnauca]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Balcazar]]></surname>
<given-names><![CDATA[J. L]]></given-names>
</name>
<name>
<surname><![CDATA[Gomez-Perez]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Closed-Set-Based Discovery of Representative Association Rules]]></article-title>
<source><![CDATA[International Journal of Foundations of Computer Science]]></source>
<year>2020</year>
<volume>31</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>143-56</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Keele]]></surname>
<given-names><![CDATA[Staffs]]></given-names>
</name>
</person-group>
<source><![CDATA[Guidelines for performing systematic literature reviews in software engineering.]]></source>
<year>2007</year>
<publisher-name><![CDATA[Technical report, Ver. 2.3 EBSE Technical Report. EBSE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shaharanee]]></surname>
<given-names><![CDATA[Izwan Nizal Mohd]]></given-names>
</name>
<name>
<surname><![CDATA[Jamil]]></surname>
</name>
</person-group>
<source><![CDATA[A framework for interestingness measures for association rules with discrete and continuous attributes based on statistical validity.]]></source>
<year>2015</year>
<page-range>119-28</page-range><publisher-name><![CDATA[IFIP International Conference on Artificial Intelligence in Theory and Practice. Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bastide]]></surname>
<given-names><![CDATA[Yves]]></given-names>
</name>
</person-group>
<source><![CDATA[Mining minimal non-redundant association rules using frequent closed itemsets.]]></source>
<year>2000</year>
<page-range>972-86</page-range><publisher-name><![CDATA[Springer, Berlin, Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balcazar]]></surname>
<given-names><![CDATA[Jose L]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules,]]></article-title>
<source><![CDATA[Logical Methods in Computer Science]]></source>
<year>2010</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>1-33</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sudarsanam]]></surname>
<given-names><![CDATA[Nandan]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Rate of change analysis for interestingness measures.]]></article-title>
<source><![CDATA[Knowledge and Information Systems]]></source>
<year>2020</year>
<volume>62</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>239-58</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Djenouri]]></surname>
<given-names><![CDATA[Youcef]]></given-names>
</name>
</person-group>
<source><![CDATA[Discovering strong meta association rules using bees swarm optimization.]]></source>
<year>2018</year>
<page-range>195-206</page-range><publisher-name><![CDATA[En Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Weidner]]></surname>
<given-names><![CDATA[Daniel]]></given-names>
</name>
<name>
<surname><![CDATA[Atzmueller]]></surname>
<given-names><![CDATA[Martin]]></given-names>
</name>
<name>
<surname><![CDATA[Dietmar]]></surname>
<given-names><![CDATA[Seipel]]></given-names>
</name>
</person-group>
<source><![CDATA[Finding Maximal Non-redundant Association Rules in Tennis Data]]></source>
<year>2019</year>
<page-range>59-78</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boudane]]></surname>
<given-names><![CDATA[Abdelhamid]]></given-names>
</name>
</person-group>
<source><![CDATA[Enumerating non-redundant association rules using satisfiability.]]></source>
<year>2017</year>
<page-range>824-36</page-range><publisher-name><![CDATA[. Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Carvalho]]></surname>
<given-names><![CDATA[Veronica Oliveira]]></given-names>
</name>
</person-group>
<source><![CDATA[Ranking Association Rules by Clustering Through Interestingness.]]></source>
<year>2017</year>
<page-range>336-51</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kryszkiewicz]]></surname>
<given-names><![CDATA[Marzena]]></given-names>
</name>
</person-group>
<source><![CDATA[Representative Rule Templates for Association Rules Satisfying Multiple Canonical Evaluation Criteria.]]></source>
<year>2018</year>
<page-range>550-61</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Chun-Hao]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Post-Analysis Framework for Mining Actionable Patterns Using Clustering and Genetic Algorithms]]></article-title>
<source><![CDATA[IEEE Access]]></source>
<year>2019</year>
<volume>7</volume>
<page-range>108101-15</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[Xiangjun]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An efficient method for pruning redundant negative and positive association rules]]></article-title>
<source><![CDATA[Neurocomputing]]></source>
<year>2020</year>
<volume>393</volume>
<page-range>245-58</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chiclana]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Arm-Amo: an efficient association rule mining algorithm based on animal migration optimization.]]></article-title>
<source><![CDATA[Knowledge-Based Systems]]></source>
<year>2018</year>
<volume>154</volume>
<page-range>68-80</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shukla]]></surname>
<given-names><![CDATA[Shekhar]]></given-names>
</name>
<name>
<surname><![CDATA[Mohanty]]></surname>
<given-names><![CDATA[B. K]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[Ashwani]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Multi Attribute Value Theory approach to rank association rules for leveraging better business decision making.]]></article-title>
<source><![CDATA[Procedia computer science]]></source>
<year>2017</year>
<volume>122</volume>
<page-range>1031-8</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ait-Mlouk]]></surname>
<given-names><![CDATA[Addi]]></given-names>
</name>
<name>
<surname><![CDATA[Agouti]]></surname>
<given-names><![CDATA[Tarik]]></given-names>
</name>
<name>
<surname><![CDATA[Gharnati]]></surname>
<given-names><![CDATA[Fatima]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mining and prioritization of association rules for big data: multi-criteria decision analysis approach.]]></article-title>
<source><![CDATA[Journal of Big Data]]></source>
<year>2017</year>
<volume>4</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-21</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jin]]></surname>
<given-names><![CDATA[Maozhu]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Hua]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Qian]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Association rules redundancy processing algorithm based on hypergraph in data mining]]></article-title>
<source><![CDATA[Cluster Computing]]></source>
<year>2019</year>
<volume>22</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>8089-98</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kryszkiewicz]]></surname>
<given-names><![CDATA[Marzena]]></given-names>
</name>
</person-group>
<source><![CDATA[A lossless representation for association rules satisfying multiple evaluation criteria.]]></source>
<year>2016</year>
<page-range>147-58</page-range><publisher-name><![CDATA[Springer, Berlin, Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kryszkiewicz]]></surname>
<given-names><![CDATA[Marzena]]></given-names>
</name>
</person-group>
<source><![CDATA[Dependence factor for association rules]]></source>
<year>2015</year>
<page-range>135-45</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Padua]]></surname>
<given-names><![CDATA[Renan]]></given-names>
</name>
<name>
<surname><![CDATA[Rezende]]></surname>
<given-names><![CDATA[Solange Oliveira]]></given-names>
</name>
<name>
<surname><![CDATA[De Carvalho]]></surname>
<given-names><![CDATA[Veronica Oliveira]]></given-names>
</name>
</person-group>
<source><![CDATA[Post-processing association rules using networks and transductive learning.]]></source>
<year>2014</year>
<page-range>318-23</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[De Padua]]></surname>
<given-names><![CDATA[Renan]]></given-names>
</name>
<name>
<surname><![CDATA[De Carvalho]]></surname>
<given-names><![CDATA[Veronica Oliveira]]></given-names>
</name>
<name>
<surname><![CDATA[REZENDE]]></surname>
<given-names><![CDATA[Solange Oliveira]]></given-names>
</name>
</person-group>
<source><![CDATA[Post-processing Association Rules: A Network Based Label Propagation Approach.]]></source>
<year>2016</year>
<page-range>580-91</page-range><publisher-name><![CDATA[Springer, Berlin, Heidelberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cifarelli]]></surname>
<given-names><![CDATA[Bruno Braga]]></given-names>
</name>
<name>
<surname><![CDATA[Miani]]></surname>
<given-names><![CDATA[Rafael Garcia Leonel]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Weakly Supervised Learning Algorithm to Eliminate Irrelevant Association Rules in Large Knowledge Bases]]></article-title>
<source><![CDATA[Journal of Information and Data Management]]></source>
<year>2020</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Heraguemi]]></surname>
</name>
<name>
<surname><![CDATA[Kamel]]></surname>
<given-names><![CDATA[Nadjet]]></given-names>
</name>
<name>
<surname><![CDATA[DRIAS]]></surname>
<given-names><![CDATA[Habiba]]></given-names>
</name>
</person-group>
<source><![CDATA[Multi-objective bat algorithm for mining interesting association rules.]]></source>
<year>2016</year>
<page-range>13-23</page-range><publisher-name><![CDATA[Springer, Cham]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gireesha]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Obulesu]]></surname>
<given-names><![CDATA[O. Tkar]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient Mining of Top-k Association Rules on Real-Life Datasets]]></source>
<year>2017</year>
<page-range>45-54</page-range><publisher-name><![CDATA[En Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications. Springer, Singapore]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="">
<collab>CORE</collab>
<source><![CDATA[Computing research &amp; education]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="">
<collab>JCR</collab>
<source><![CDATA[SJR: Scientific Journal Rankings]]></source>
<year>2019</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
