MAXLEN-FI: THUẬT TOÁN KHAI THÁC NHANH TẬP PHỔ BIẾN CÓ CHIỀU DÀI TỐI ĐA TRÊN DỮ LIỆU GIAO DỊCH
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...
שמור ב:
| Những tác giả chính: | , |
|---|---|
| פורמט: | Bài viết |
| שפה: | Vietnamese |
| יצא לאור: |
Trường Đại học Đà Lạt
2023
|
| גישה מקוונת: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/407 https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/114292 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| סיכום: | 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. |
|---|