کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
384516 | 660848 | 2009 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Finding “persistent rules”: Combining association and classification results
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Different data mining algorithms applied to the same data can result in similar findings, typically in the form of rules. These similarities can be exploited to identify especially powerful rules, in particular those that are common to the different algorithms. This research focuses on the independent application of association and classification mining algorithms to the same data to discover common or similar rules, which are deemed “persistent-rules”. The persistent-rule discovery process is demonstrated and tested against two data sets drawn from the American National Election Studies: one data set used to predict voter turnout and the second used to predict vote choice.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 36, Issue 3, Part 2, April 2009, Pages 6019–6024
Journal: Expert Systems with Applications - Volume 36, Issue 3, Part 2, April 2009, Pages 6019–6024
نویسندگان
Karthik Rajasethupathy, Anthony Scime, Kulathur S. Rajasethupathy, Gregg R. Murray,