Mining weak rules
暂无分享,去创建一个
Finding patterns from data sets is a fundamental task of data mining. If we categorize all patterns into strong, weak, and random, conventional data mining techniques are designed only to find strong patterns, which hold for numerous objects and are usually consistent with the expectations of experts. We address the problem of finding weak patterns (i.e., reliable exceptions) from databases. They are valid for a small number of objects. A simple approach is proposed which uses deviation analysis to identify interesting exceptions and explore reliable ones. It is also flexible in handling both subjective and objective exceptions. We demonstrate the effectiveness of the proposed approach through a benchmark data set.
[1] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[2] Christopher J. Merz,et al. UCI Repository of Machine Learning Databases , 1996 .
[3] Einoshin Suzuki,et al. Autonomous Discovery of Reliable Exception Rules , 1997, KDD.