Search In this Thesis
   Search In this Thesis  
العنوان
Association rules for Data Mining /
المؤلف
El-Gaml, El-Sayeda Mahdy Abd El-Rahman Mohamed.
هيئة الاعداد
باحث / السيدة مهدى عبد الرحمن محمد الجمل
مشرف / حاتم محمد سيد عبد القادر
مناقش / السيد عبد الحميد سلام
مشرف / لا يوجد
الموضوع
Computers and control engineering.
تاريخ النشر
2015.
عدد الصفحات
p 123. :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
هندسة النظم والتحكم
تاريخ الإجازة
1/1/2015
مكان الإجازة
جامعة طنطا - كلية الهندسه - Computers and control engineering
الفهرس
Only 14 pages are availabe for public view

from 16

from 16

Abstract

Association Rule mining is one of the most important fields in data mining and knowledge discovery. The basic algorithm is called Apriori Algorithm that depends on mining frequent itemsets using candidate generation with the increase of the database dimensionality and the number of items therefore a lot of defects Due to the presence of candidate generation and the following challenges appear: More search space is needed and I/O cost will increase. Number of database scan is increased, thus candidate generation will increase results in increase in computational cost. Rule explosion.Some features are added to Apriori Like multiple minimum supports using maximum constraints to decrease computational cost. This approach allowed users to specify different minimum support (minsup) to different items. This feature provides a good pruning effect and decrease time processing .