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!
|
| _version_ | 1832557699171090432 |
|---|---|
| author | Dương Văn Hải Trương Chí Tín |
| author_facet | Dương Văn Hải Trương Chí Tín |
| author_sort | Dương Văn Hải |
| collection | DOAJ |
| description | 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 directly from the database. In this paper, a structure and unique representation of frequent item-sets restricted on constraint Co using closed frequent item-sets and their generators are proposed. Then, an algorithm called MFS-Contain-IC is developed to quickly and distinctly generate all frequent item-sets containing Co. The theoretical results are proven to be reliable. Extensive experiments on a broad range of synthetic and real data-sets show the effectiveness of present study. |
| format | Article |
| id | doaj-art-4fbcb082d2ae49b2986baa175f09653b |
| institution | Kabale University |
| issn | 0866-787X |
| language | English |
| publishDate | 2013-06-01 |
| publisher | Dalat University |
| record_format | Article |
| series | Tạp chí Khoa học Đại học Đà Lạt |
| spelling | doaj-art-4fbcb082d2ae49b2986baa175f09653b2025-02-03T03:12:13ZengDalat UniversityTạp chí Khoa học Đại học Đà Lạt0866-787X2013-06-013210.37569/DalatUniversity.3.2.250(2013)AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSETDương Văn Hải0Trương Chí Tín1Faculty of Mathematics and Computer Science, Dalat UniversityFaculty of Mathematics and Computer Science, Dalat UniversityFor 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 directly from the database. In this paper, a structure and unique representation of frequent item-sets restricted on constraint Co using closed frequent item-sets and their generators are proposed. Then, an algorithm called MFS-Contain-IC is developed to quickly and distinctly generate all frequent item-sets containing Co. The theoretical results are proven to be reliable. Extensive experiments on a broad range of synthetic and real data-sets show the effectiveness of present study.https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/250Frequent item-setsClosed frequent item-setsClosed item-set latticeGeneratorsConstraint mining. |
| spellingShingle | Dương Văn Hải Trương Chí Tín AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET Tạp chí Khoa học Đại học Đà Lạt Frequent item-sets Closed frequent item-sets Closed item-set lattice Generators Constraint mining. |
| title | AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET |
| title_full | AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET |
| title_fullStr | AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET |
| title_full_unstemmed | AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET |
| title_short | AN EFFICIENT ALGORITHM FOR MINING FREQUENT ITEM-SETS CONTAINING A CONSTRAINT SUBSET |
| title_sort | efficient algorithm for mining frequent item sets containing a constraint subset |
| topic | Frequent item-sets Closed frequent item-sets Closed item-set lattice Generators Constraint mining. |
| url | https://tckh.dlu.edu.vn/index.php/tckhdhdl/article/view/250 |
| work_keys_str_mv | AT duongvanhai anefficientalgorithmforminingfrequentitemsetscontainingaconstraintsubset AT truongchitin anefficientalgorithmforminingfrequentitemsetscontainingaconstraintsubset AT duongvanhai efficientalgorithmforminingfrequentitemsetscontainingaconstraintsubset AT truongchitin efficientalgorithmforminingfrequentitemsetscontainingaconstraintsubset |