کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9662333 | 698658 | 2005 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient algorithm for finding dense regions for mining quantitative association rules
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Many algorithms have been proposed for mining boolean association rules. However, very little work has been done in mining quantitative association rules. Although we can transform quantitative attributes into boolean attributes, this approach is not effective and is difficult to scale up for high-dimensional cases and also may result in many imprecise association rules. Newly designed algorithms for quantitative association rules still are persecuted by the problems of nonscalability and noise. In this paper, an efficient algorithm, DRMiner, is proposed. By using the notion of “density” to capture the characteristics of quantitative attributes and an efficient procedure to locate the “dense regions”, DRMiner not only can solve the problems of previous approaches, but also can scale up well for high-dimensional cases. Evaluations on DRMiner have been performed using synthetic databases. The results show that DRMiner is effective and can scale up quite linearly with the increasing number of attributes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 50, Issues 3â4, August 2005, Pages 471-490
Journal: Computers & Mathematics with Applications - Volume 50, Issues 3â4, August 2005, Pages 471-490
نویسندگان
Wang Lian, David W. Cheung, S.M. Yiu,