کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1144255 | 957389 | 2009 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Strongest Association Rules Mining for Personalized Recommendation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Systems Engineering - Theory & Practice - Volume 29, Issue 8, August 2009, Pages 144-152
Journal: Systems Engineering - Theory & Practice - Volume 29, Issue 8, August 2009, Pages 144-152