CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

Title: Very fast mining of association rules

عنوان مقاله: Title: Very fast mining of association rules
شناسه ملی مقاله: KAUCEE01_053
منتشر شده در کنفرانس ملی پژوهش های نوین در برق، کامپیوتر و مهندسی پزشکی در سال 1396
مشخصات نویسندگان مقاله:

Amir Ebrahimzadeh - Sama technical and vocational training college, Islamic Azad University, Mashhad branch, Mashhad, Iran

خلاصه مقاله:
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

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/658073/