An efficient algorithm for mining frequent itemsets containing a constraint subset
For users, it is necessary to find frequent itemsets incl uding a subset Co whose value is changed regularly. Recently, many studies showed that the mining of frequent itemsets with often changed constraints should be based on the lattice of closed itemsets and generators instead of mining them dir...
Đã lưu trong:
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Trường Đại học Đà Lạt
2014
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| Tóm tắt: | For users, it is necessary to find frequent itemsets incl uding a subset Co whose value is changed regularly. Recently, many studies showed that the mining of frequent itemsets with often changed constraints should be based on the lattice of closed itemsets
and generators instead of mining them directly from the database. In this paper, a
structure and unique representation of frequent item sets restricted on constraint Cousing closed frequent itemsets and their generators are proposed . Then, an algorithm called MFS-Contain-IC is developed to quickly and distinctly generate all frequent itemsets containing Co. The theoretical results are proven to be rel iabl e. Extensive experiments on a broad range of synthetic and real datasets show the effectiveness of present study. |
|---|