- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Proposed Algorithm for Extracting Association Rule Depend on Closed Frequent Itemset (EACFI) | ||
| Engineering and Technology Journal | ||
| Article 1, Volume 29, Issue 11, 2011, Pages 2202-2209 PDF (206.64 K) | ||
| DOI: 10.30684/etj.29.11.9 | ||
| Authors | ||
| Emad k. Jbbar; Yaser Munther | ||
| Abstract | ||
| Association rules are important one of data mining activities. All algorithms of association rule mining consist of finding frequency of itemsets, which satisfy a minimum support threshold, and then compute confidence percentage for each k-itemsets to construct strong association rules’. Some of these association rules are not important because the extracted knowledge from their is found in other. Hence we proposed algorithm to construct only important association rules by depend on closed frequent itemset. An itemset is closed if one of its immediate supersets has the same support as the itemset. Finding these closed frequent itemsets can be of a great help to purge a lot of itemsets that are not needed to find association rules. So that aid to reduce execution time and work space of algorithm and end the algorithm at any level of k-itemset, without construct all K-itemset. | ||
|
Statistics Article View: 296 PDF Download: 137 |
||