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: | , |
|---|---|
| 格式: | Bài viết |
| 語言: | English |
| 出版: |
Trường Đại học Đà Lạt
2014
|
| 主題: | |
| 在線閱讀: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|