Ara
Toplam kayıt 41, listelenen: 21-30
Cost-conscious comparison of supervised learning algorithms over multiple data sets
(Elsevier Sci Ltd, 2012-04)
In the literature, there exist statistical tests to compare supervised learning algorithms on multiple data sets in terms of accuracy but they do not always generate an ordering. We propose Multi(2)Test, a generalization ...
Univariate decision tree induction using maximum margin classification
(Oxford Univ Press, 2012-03)
In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin ...
Design and analysis of classifier learning experiments in bioinformatics: survey and case studies
(IEEE Computer Soc, 2012-12)
In many bioinformatics applications, it is important to assess and compare the performances of algorithms trained from data, to be able to draw conclusions unaffected by chance and are therefore significant. Both the design ...
Incremental construction of rule ensembles using classifiers produced by different class orderings
(IEEE, 2016)
In this paper, we discuss a novel approach to incrementally construct a rule ensemble. The approach constructs an ensemble from a dynamically generated set of rule classifiers. Each classifier in this set is trained by ...
VC-dimension of rule sets
(IEEE Computer Soc, 2014-12-04)
In this paper, we give and prove lower bounds of the VC-dimension of the rule set hypothesis class where the input features are binary or continuous. The VC-dimension of the rule set depends on the VC-dimension values of ...
Omnivariate rule induction using a novel pairwise statistical test
(IEEE Computer Soc, 2013-09)
Rule learning algorithms, for example, RIPPER, induces univariate rules, that is, a propositional condition in a rule uses only one feature. In this paper, we propose an omnivariate induction of rules where under each ...
Mapping classifiers and datasets
(Pergamon-Elsevier Science Ltd, 2011-04)
Given the posterior probability estimates of 14 classifiers on 38 datasets, we plot two-dimensional maps of classifiers and datasets using principal component analysis (PCA) and Isomap. The similarity between classifiers ...
Soft decision trees
(IEEE, 2012)
We discuss a novel decision tree architecture with soft decisions at the internal nodes where we choose both children with probabilities given by a sigmoid gating function. Our algorithm is incremental where new nodes are ...
All-words word sense disambiguation for Turkish
(IEEE, 2017)
Identifying the sense of a word within a context is a challenging problem and has many applications in natural language processing. This assignment problem is called word sense disambiguation(WSD). Many papers in the ...
Cryptanalysis of Fridrich's chaotic image encryption
(World Scientific Publishing, 2010-05)
We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret ...