Classification with Evidential Associative Rules

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mining database provides valuable information such as frequent patterns and especially associative rules. The associative rules have various applications and assets mainly data classification. The appearance of new and complex data support such as evidential databases has led to redefine new methods to extract pertinent rules. In this paper, we intend to propose a new approach for pertinent rule's extraction on the basis of confidence measure redefinition. The confidence measure is based on conditional probability basis and sustains previous works. We also propose a classification approach that combines evidential associative rules within information fusion system. The proposed methods are thoroughly experimented on several constructed evidential databases and showed performance improvement. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Samet, A., Lefèvre, E., & Ben Yahia, S. (2014). Classification with Evidential Associative Rules. In Communications in Computer and Information Science (Vol. 442 CCIS, pp. 25–35). Springer Verlag. https://doi.org/10.1007/978-3-319-08795-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free