Confirmation rule sets

15Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The concept of confirmation rule sets represents a frame-work for reliable decision making that combines two principles that are effective for increasing the predictive accuracy: consensus in an ensemble of classifiers and indecisive or probabilistic predictions in cases when reliable decisions are not possible. The confirmation rules concept uses a separate classifier set for every class of the domain. In this decision model different rules can be incorporated: either those obtained by applying one or more inductive learning algorithms or even rules representing human encoded expert domain knowledge. The only conditions for the inclusion of a rule into the confirmation rule set are its high predictive value and relative independence of other rules in the confirmation rule set. This paper introduces the concept of confirmation rule sets, together with an algorithm for selecting relatively independent rules from a set of all acceptable confirmation rules and an algorithm for the systematic construction of a set of confirmation rules.

Cite

CITATION STYLE

APA

Gamberger, D., & Lavrač, N. (2000). Confirmation rule sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1910, pp. 34–43). Springer Verlag. https://doi.org/10.1007/3-540-45372-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