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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | 論文 |
| 言語: | 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 |
|---|