Finding Stable Periodic-Frequent Itemsets in Big Columnar Databases
Stable periodic-frequent itemset mining is essential in big data analytics with many real-world applications. It involves extracting all itemsets exhibiting stable periodic behaviors in a temporal database. Most previous studies focused on finding these itemsets in row (temporal) databases and disre...
Main Authors: | Hong N. Dao, Penugonda Ravikumar, Palla Likhitha, Uday Kiran Rage, Yutaka Watanobe, Incheon Paik |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10034746/ |
Similar Items
-
Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-11-01) -
Multi-Objective Optimization for High-Dimensional Maximal Frequent Itemset Mining
by: Yalong Zhang, et al.
Published: (2021-09-01) -
High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
by: Gede Aditra Pradnyana, et al.
Published: (2021-04-01) -
A New Algorithm to Preserve Sensitive Frequents Itemsets (APSFI) in Horizontal or Vertical Database
by: Hussein K. AL-Khafaji, et al.
Published: (2013-06-01) -
Hiding Sensitive Itemsets Using Sibling Itemset Constraints
by: Baris Yildiz, et al.
Published: (2022-07-01)