This study is aimed at realizing a system that automatically finds appropriate ranges for numeric attributes in a given huge database. The study mainly focuses on computing two optimized ranges: one that maximizes the support on the condition that the confidence ratio is at least a given threshold value, and another that maximizes the confidence ratio on the condition that the support is at least a given threshold number. Using techniques from computational geometry, presented are novel algorithms that compute the optimized ranges in linear time if the data are sorted. Tests show the implementation to be fast not only in theory but also in practice.
|Number of pages||10|
|Publication status||Published - 1996|
|Event||Proceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS - Montreal, Can|
Duration: 1996 Jun 3 → 1996 Jun 5
|Other||Proceedings of the 1996 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS|
|Period||96/6/3 → 96/6/5|
ASJC Scopus subject areas