Title of article
Comprehensive vs. comprehensible classifiers in logical analysis of data Original Research Article
Author/Authors
Gabriela Alexe، نويسنده , , Sorin Alexe، نويسنده , , Peter L. Hammer، نويسنده , , Alexander Kogan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
13
From page
870
To page
882
Abstract
The main objective of this paper is to compare the classification accuracy provided by large, comprehensive collections of patterns (rules) derived from archives of past observations, with that provided by small, comprehensible collections of patterns. This comparison is carried out here on the basis of an empirical study, using several publicly available data sets. The results of this study show that the use of comprehensive collections allows a slight increase of classification accuracy, and that the “cost of comprehensibility” is small.
Keywords
Pattern , Spanned pattern , Pattern-based classifier , Prime pattern , Logical analysis of data (LAD)
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886703
Link To Document