Bounded Support and Confidence over Evidential Databases
Evidential database has showed its potential application in many fields of study. This specific database framework allows frequent patterns and associative classification rules to be extracted in a more efficient way from uncertain and imprecise data. The definition of support and confidence measures plays an important role in the extraction process of meaningful patterns and rules. In this present work, we proposed a new definition of support and confidence measures based on interval representation. Moreover, a new algorithm, named EBS-Apriori, based on these bounded measures and several pruning strategies was developed. Experiments were conducted using several database benchmarks. Performance analysis showed a better prediction outcome for our proposed approach in comparison with several literature-based methods.