View in EDS

Designing a Gradual Support Inference Graph to Improve the Performance of Frequent Gradual Pattern Extraction Algorithms.

Saved in:
Bibliographic Details
Title: Designing a Gradual Support Inference Graph to Improve the Performance of Frequent Gradual Pattern Extraction Algorithms.
Authors: Kenmogne, Edith Belise1 (AUTHOR) ebkenmogne@gmail.com, Djamegni, Clémentin Tayou1,2 (AUTHOR) dtayou@gmail.com, Tetakouchom, Idriss1 (AUTHOR) itetakouchom@gmail.com, Fotso, Laurent Cabrel Tabueu3 (AUTHOR) laurent.tabueu@gmail.com
Source: New Generation Computing. Aug2026, Vol. 44 Issue 3, p1-27. 27p.
Subjects: Data mining, Patterns (Mathematics), Transaction records, Optimization algorithms
Abstract: Gradual patterns translate co-variations of the numerical attributes of transactional databases. They play a crucial role in many real-world applications where there is a large amount of digital data to manage. This type of patterns has attracted attention of the data mining community, and several algorithms have been designed to extract frequent gradual patterns from transactional databases. The algorithms for extracting frequent gradual patterns in large databases are CPU and memory intensive, which poses the problem of improving their performance. This paper proposes a novel approach to improve the performance of frequent gradual pattern mining algorithms. It relies on the design of a gradual support inference graph to avoid redundancies in the calculations of gradual supports and to bypass the calculation and storage of the adjacency matrices of certain patterns. The exploitation of said graph in the extraction algorithms leads to a significant improvement in CPU and memory consumption. Experimental results on transactional databases of different natures confirm the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]
Copyright of New Generation Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Gradual patterns translate co-variations of the numerical attributes of transactional databases. They play a crucial role in many real-world applications where there is a large amount of digital data to manage. This type of patterns has attracted attention of the data mining community, and several algorithms have been designed to extract frequent gradual patterns from transactional databases. The algorithms for extracting frequent gradual patterns in large databases are CPU and memory intensive, which poses the problem of improving their performance. This paper proposes a novel approach to improve the performance of frequent gradual pattern mining algorithms. It relies on the design of a gradual support inference graph to avoid redundancies in the calculations of gradual supports and to bypass the calculation and storage of the adjacency matrices of certain patterns. The exploitation of said graph in the extraction algorithms leads to a significant improvement in CPU and memory consumption. Experimental results on transactional databases of different natures confirm the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]
ISSN:02883635
DOI:10.1007/s00354-026-00324-w