MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST
Association rule mining, one of the most important and well-researched techniques of data mining. Mining frequent itemsets are one of the most fundamental and most time-consuming problems in association rule mining. However, real-world applications are often sufficient to mine a small representative...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2018-07-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/407 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832570691876028416 |
|---|---|
| author | Phan Thành Huấn Lê Hoài Bắc |
| author_facet | Phan Thành Huấn Lê Hoài Bắc |
| author_sort | Phan Thành Huấn |
| collection | DOAJ |
| description | Association rule mining, one of the most important and well-researched techniques of data mining. Mining frequent itemsets are one of the most fundamental and most time-consuming problems in association rule mining. However, real-world applications are often sufficient to mine a small representative subset of frequent itemsets with low computational cost in generating association rules – maximum-length frequent itemsets. Maximum-length frequent itemsets can be useful in many application domains. In this paper, we proposed an algorithm called MAXLEN-FI for mining maximum-length frequent itemsets fast using an array of co-occurrence items. Finally, we presented experimental results on both synthetic and real-life datasets, which showed that the proposed algorithm performed better than the existing algorithms. |
| format | Article |
| id | doaj-art-363b7c283e6d4aa5ba7b3c8b9f94bbd4 |
| institution | Kabale University |
| issn | 0866-787X 0866-787X |
| language | English |
| publishDate | 2018-07-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-363b7c283e6d4aa5ba7b3c8b9f94bbd42025-02-02T14:32:09ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X0866-787X2018-07-018210912310.37569/DalatUniversity.8.2.407(2018)246MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FASTPhan Thành Huấn0Lê Hoài Bắc1Bộ môn Tin học, Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Tp. Hồ Chí MinhKhoa Công nghệ thông tin, Trường Đại học Khoa học Tự nhiên, Đại học Quốc gia Tp. Hồ Chí MinhAssociation rule mining, one of the most important and well-researched techniques of data mining. Mining frequent itemsets are one of the most fundamental and most time-consuming problems in association rule mining. However, real-world applications are often sufficient to mine a small representative subset of frequent itemsets with low computational cost in generating association rules – maximum-length frequent itemsets. Maximum-length frequent itemsets can be useful in many application domains. In this paper, we proposed an algorithm called MAXLEN-FI for mining maximum-length frequent itemsets fast using an array of co-occurrence items. Finally, we presented experimental results on both synthetic and real-life datasets, which showed that the proposed algorithm performed better than the existing algorithms.http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/407luật kết hợptập phổ biếntập phổ biến có chiều dài tối đa. |
| spellingShingle | Phan Thành Huấn Lê Hoài Bắc MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST Tạp chí Khoa học Đại học Đà Lạt luật kết hợp tập phổ biến tập phổ biến có chiều dài tối đa. |
| title | MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST |
| title_full | MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST |
| title_fullStr | MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST |
| title_full_unstemmed | MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST |
| title_short | MAXLEN-FI: AN ALGORITHM FOR MINING MAXIMUM- LENGTH FREQUENT ITEMSETS FAST |
| title_sort | maxlen fi an algorithm for mining maximum length frequent itemsets fast |
| topic | luật kết hợp tập phổ biến tập phổ biến có chiều dài tối đa. |
| url | http://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/407 |
| work_keys_str_mv | AT phanthanhhuan maxlenfianalgorithmforminingmaximumlengthfrequentitemsetsfast AT lehoaibac maxlenfianalgorithmforminingmaximumlengthfrequentitemsetsfast |