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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Trường Đại học Đà Lạt
2014
|
| Témata: | |
| On-line přístup: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|