Mining Association Rules on Time-sensitive Data
Real-world data is continuously produced andcollected quickly; hence, mining association rules are used tofind relationships between item sets. One of these combinedrule mining techniques is Rare Association Rule Mining(RARM), a method that extracts rare, combined rules with lowsupport but high confidence from the database. Additionally,a large amount of time-sensitive data is created in many fields,and combining valid and outdated data leads to low efficiencyin extracting combined rules. This paper explores a miningmethod that increases rare, combined rules on time-sensitivedata to extract common and rare patterns in the database.The primary approach of the research proposes a new treestructure called ILC-tree, inspired by the LC-tree structurepublished in 2022. Specifically, our approach includes a newtree structure and a fast reconstruction method. The proposedapproach reduces execution time and memory consumptionby approximately 2 times compared to the old tree structure.
Authors
- Kim Nguyen (ORCID: https://orcid.org/0000-0002-9112-0221)
Institutions
- CNS Research (United States) (US)
Publication Details
- Journal
- Research and Development on Information and Communication Technology
- Published
- 2024-09-15
- DOI
- https://doi.org/10.32913/mic-ict-research.v2024.n2.1256
- Primary Topic
- Data Mining Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00