- 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
OFGIM: A New Algorithm to Mine Generalized-Itemsets | ||
| Al-Rafidain University College For Sciences | ||
| Article 1, Volume 0, Issue 32, 2017, Pages 70-93 | ||
| Author | ||
| Hussein K. Khafaji | ||
| Abstract | ||
| Most databases mined by a single layer/ crisp association rules algorithms are not flat but contain data in hierarchal/ generalized format. In spite of this fact, a few algorithms available to mine generalized itemsets to produce generalized association rules, GAR, which escort to mine more specific and concrete knowledge for decision makers. This research presents a new algorithm, (Optimized Frequent Generalized Itemsets Miner (OFGIM)), to mine generalized itemsets. Simply, it depends on extending the transactions of a database. The extension is done by adding the parent of an item to the transaction containing the item. The mining process is accomplished by the union of itemsets and the intersection of the tidsets. The algorithm requires two database scans only; the first one is for extending operation and the second scan is for mining process. The proposed algorithm does not need a specified data structure such as hash tree and prunes the apriori-based pruning steps.OFGJM was tested by using six synthetic databases. OFGJM overcomes apriori based algorithm in a ratio of ¼ in all the experiments, but it exhibitsits RAMappealing. | ||
| Keywords | ||
| generalized; Itemsets | ||
|
Statistics Article View: 147 PDF Download: 109 |
||