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 |
|---|