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: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Trường Đại học Đà Lạt
2014
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| Các nhãn: |
Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| Thư viện lưu trữ: | Thư viện Trường Đại học Đà Lạt |
|---|
| id |
oai:scholar.dlu.edu.vn:DLU123456789-37526 |
|---|---|
| record_format |
dspace |
| spelling |
oai:scholar.dlu.edu.vn:DLU123456789-375262023-10-27T14:42:18Z An efficient algorithm for mining frequent itemsets containing a constraint subset Duong, Van Hai Truong, Chi Tin Frequent itemsets Closed frequent itemsets 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 directly from the database. In this paper, a structure and unique representation of frequent item sets restricted on constraint Cousing closed frequent itemsets and their generators are proposed . Then, an algorithm called MFS-Contain-IC is developed to quickly and distinctly generate all frequent itemsets containing Co. The theoretical results are proven to be rel iabl e. Extensive experiments on a broad range of synthetic and real datasets show the effectiveness of present study. 2014-06-05T09:02:45Z 2014-06-05T09:02:45Z 2013 Article https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 en Tạp chí Khoa học Đại học Đà Lạt, số 6;tr. 54-64 application/pdf Trường Đại học Đà Lạt |
| institution |
Thư viện Trường Đại học Đà Lạt |
| collection |
Thư viện số |
| language |
English |
| topic |
Frequent itemsets Closed frequent itemsets |
| spellingShingle |
Frequent itemsets Closed frequent itemsets Duong, Van Hai Truong, Chi Tin An efficient algorithm for mining frequent itemsets containing a constraint subset |
| description |
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 directly from the database. In this paper, a
structure and unique representation of frequent item sets restricted on constraint Cousing closed frequent itemsets and their generators are proposed . Then, an algorithm called MFS-Contain-IC is developed to quickly and distinctly generate all frequent itemsets containing Co. The theoretical results are proven to be rel iabl e. Extensive experiments on a broad range of synthetic and real datasets show the effectiveness of present study. |
| format |
Article |
| author |
Duong, Van Hai Truong, Chi Tin |
| author_facet |
Duong, Van Hai Truong, Chi Tin |
| author_sort |
Duong, Van Hai |
| title |
An efficient algorithm for mining frequent itemsets containing a constraint subset |
| title_short |
An efficient algorithm for mining frequent itemsets containing a constraint subset |
| title_full |
An efficient algorithm for mining frequent itemsets containing a constraint subset |
| title_fullStr |
An efficient algorithm for mining frequent itemsets containing a constraint subset |
| title_full_unstemmed |
An efficient algorithm for mining frequent itemsets containing a constraint subset |
| title_sort |
efficient algorithm for mining frequent itemsets containing a constraint subset |
| publisher |
Trường Đại học Đà Lạt |
| publishDate |
2014 |
| url |
https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37526 |
| _version_ |
1781718874025099264 |