Frequent itemset mining in high dimensional data: a review
This paper provides a brief overview of the techniques used in frequent itemset mining. It discusses the search strategies used; i.e. depth first vs. breadth-first, and dataset representation; i.e. horizontal vs. vertical representation. In addition, it reviews many techniques used in several algori...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English English |
| Published: |
Springer
2019
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/67014/ http://irep.iium.edu.my/67014/ http://irep.iium.edu.my/67014/ http://irep.iium.edu.my/67014/1/67014_Frequent%20Itemset%20Mining%20in%20High%20Dimensional%20Data.pdf http://irep.iium.edu.my/67014/2/67014_Frequent%20Itemset%20Mining%20in%20High%20Dimensional%20Data_SCOPUS.pdf |
| Summary: | This paper provides a brief overview of the techniques used in frequent itemset mining. It discusses the search strategies used; i.e. depth first vs. breadth-first, and dataset representation; i.e. horizontal vs. vertical representation. In addition, it reviews many techniques used in several algorithms that make frequent itemset mining more efficient. These algorithms are discussed based on the proposed search strategies which include row-enumeration vs. column-enumeration, bottom-up vs. top-down traversal, and a number of new data structures. Finally, the paper reviews on the latest algorithms of colossal frequent itemset/pattern which currently is the most relevant to mining highdimensional dataset. |
|---|