Evaluating Restrictions in Pattern Based Classifiers

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Generalizations, also known as patterns, are in the core of many learning systems. A key component for automatically mine generalizations is to define the predicate to select the most important ones. This predicate is usually expressed as a conjunction of restrictions. In this paper, we present an experimental study of some of the most used restrictions: the minimal support threshold, the jumping pattern and the minimal pattern. This study that uses 93 databases and two different classifiers reveals some interesting results, including one that should be very useful for building better classifiers: using minimal patterns could degrade the accuracy.

Cite

CITATION STYLE

APA

González-Méndez, A., Martín-Rodríguez, D., & García-Borroto, M. (2019). Evaluating Restrictions in Pattern Based Classifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11896 LNCS, pp. 439–448). Springer. https://doi.org/10.1007/978-3-030-33904-3_41

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