• Jan 04, 2024 News!IJFCC will adopt Article-by-Article Work Flow
  • Aug 10, 2026 News!Vol.15, No.2 has been published with online version.   [Click]
  • Mar 30, 2026 News!Vol.15, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751 (Print)
    • Frequency: Semi-annual
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Pascal Lorenz
    • Executive Editor: Ms. Fanny Fang
    • Abstracting/ Indexing: Crossref, Electronic Journals Library, Google Scholar, EBSCO, etc.
    • E-mail:  editor@ijfcc.org
    • Article Processing Charge: 500 USD
Editor-in-chief

Prof. Pascal Lorenz
University of Haute Alsace, France
 
It is my honor to be the Editor-in-Chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.

IJFCC 2023 Vol.12(4): 84-92
doi: 10.18178/ijfcc.2023.12.4.608

An Efficient Approach for Mining Closed High Utility Patterns in the Incremental Database

Ye In Chang , Po Chun Chuang , Chun Yu Wang * , Yu Hao Liao

  • Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan.

* Corresponding author

Abstract

The utility of an itemset is the product of the profitand the frequency of the itemset in the database. If it is largerthan the given threshold, it is defined as the high utility pattern.If there is no superset which has the same frequency as thefrequency of its subset, the itemset can be considered as theclosed itemset. If the itemset satisfies both the high utility andthe closed property, the itemset is defined as the closed highutility itemset/pattern (CHUI). Among those algorithms basedon the utility-list structure, the HMiner- Closed algorithm is themost efficient algorithm. However, if the value of the thresholddecreases, the number of candidate CHUIs increases anddecreases the efficiency of the algorithm. Therefore, in thispaper, we propose an efficient algorithm based on a closed-setlattice structure. Our algorithm first finds the closed itemsetsand then finds CHUIs in those itemsets. By checking the setrelationship between the transactions, we first inserttransactions into the closed-set lattice structure. Our algorithmalso considers data insertion/deletion in the incrementaldatabase. From our performance study, we show that ourproposed approach is more efficient than the HMiner-Closedalgorithm.

Keywords

  • Closed high utility patterns
  • closed-set lattice
  • data mining
  • incremental database
  • lattice
IJFCC-V12N4-608

How to Cite

Copied

Ye In Chang, Po Chun Chuang, Chun Yu Wang, and Yu Hao Liao, "An Efficient Approach for Mining Closed High Utility Patterns in the Incremental Database," International Journal of Future Computer and Communication, vol. 12, no. 4, pp. 84-92, 2023. https://doi.org/ 10.18178/ijfcc.2023.12.4.608

Copyright & License

Copyright © 2023 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Article Metrics in Dimensions

Copyright © 2012-2026. International Journal of Future Computer and Communication. Unless otherwise stated.

E-mail: editor@ijfcc.org