SciELO - Scientific Electronic Library Online

 
vol.22 issue2Reconstruction of PET Images Using Anatomical Adaptive Parameters and Hybrid RegularizationExploration of DNA Microarrays Using Data Mining and a Taboo Search author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

On-line version ISSN 2007-9737Print version ISSN 1405-5546

Abstract

DIAZ-MOLINA, Arnaldo  and  GARCIA-GARRIDO, Luciano. FP-MAXFLOW: An Algorithm for Mining Maximum Relevant Patterns. Comp. y Sist. [online]. 2018, vol.22, n.2, pp.563-583.  Epub Jan 21, 2021. ISSN 2007-9737.  https://doi.org/10.13053/cys-22-2-2498.

Algorithms for itemsets recognition and classification have been widely studied. The state of the art shows that most of the algorithms obtain all possible itemsets, others only obtain maximal ones. Both approaches have limitations for getting relevant correlations. Obtaining all itemsets imply many irrelevant patterns. By obtaining only maximal patterns important information could be ignored. The goal of this work is to offer an algorithm for obtaining the patterns which more efficiently could describe the correlations. The new algorithm, called FP-MAXFLOW is able to extract these, information efficiently with one database scan. The comparative studies show that it is a competitive solution according to other algorithms which are among the most used.

Keywords : Transactional databases; association mining; patterns recognition; frequent itemsets.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )