کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10325320 | 670618 | 2005 | 26 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Finding the most interesting correlations in a database: how hard can it be?
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Finding the most interesting correlations in a database: how hard can it be? Finding the most interesting correlations in a database: how hard can it be?](/preview/png/10325320.png)
چکیده انگلیسی
This paper addresses some of the foundational issues associated with discovering the best few correlations from a database. Specifically, we consider the computational complexity of various definitions of the “top-k correlation problem,” where the goal is to discover the few sets of events whose co-occurrence exhibits the smallest degree of independence. Our results show that many rigorous definitions of correlation lead to intractable and strongly inapproximable problems. Proof of this inapproximability is significant, since similar problems studied by the computer science theory community have resisted such analysis. One goal of the paper (and for future research) is to develop alternative correlation metrics whose use will both allow efficient search and produce results that are satisfactory for users.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Systems - Volume 30, Issue 1, March 2005, Pages 21-46
Journal: Information Systems - Volume 30, Issue 1, March 2005, Pages 21-46
نویسندگان
Christopher Jermaine,