AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET
For users, it is necessary to find frequent item-sets including a subset Co whose value is changed regularly. Recently, many studies showed that the mining of frequent item-sets with often changed constraints should be based on the lattice of closed item-sets and generators instead of mining them di...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Dalat University
2013-06-01
|
| Series: | Tạp chí Khoa học Đại học Đà Lạt |
| Subjects: | |
| Online Access: | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/250 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!