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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
Trường Đại học Đà Lạt
2014
|
| Materias: | |
| Acceso en línea: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|