Abstract Discovering maximal frequent itemsets is an important issue and key technique in many data mining problems such as association rule mining. In the literature, generating proves either to be NP-hard or have O ( l 3 4 m ...

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 a temporal database. Most previous studies focused on finding these row (temporal) databases and disregarded the occurrences of columnar databases. Furthermore, naïve approach transforming database into then applyi...