Title: Very fast mining of association rules
سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 436
فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
این مقاله در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
KAUCEE01_053
تاریخ نمایه سازی: 29 مهر 1396
چکیده مقاله:
Mining association rules is one of the important research problems in data mining. So, many algorithms have been proposed to find association rules in databases.one of the most popular algorithms is apriori . based on this algorithm this paper indicates the limitation of the original apriori algorithm of wasting time for scanning the whole database searching on the frequent itemsets , and presents an improvement on apriori by reducing that waste time depending on scanning only some transaction(by clustering the database and using new structures named subvector for each cluster).Performance and efficiency of proposed method has been compared with Apriori algorithms. Experiments illustrate that our algorithm will do better than apriori algorithm .
کلیدواژه ها:
data mining- cluster table- association rules
نویسندگان
Amir Ebrahimzadeh
Sama technical and vocational training college, Islamic Azad University, Mashhad branch, Mashhad, Iran