## Ara

Toplam kayıt 34, listelenen: 1-10

#### 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 ...

#### Unsupervised morphological analysis using tries

(Springer London, 2011-09-28)

This article presents an unsupervised morphological analysis algorithm to segment words into roots and affixes. The algorithm relies on word occurrences in a given dataset. Target languages are English, Finnish, and Turkish, ...

#### Incremental construction of classifier and discriminant ensembles

(ELSEVIER SCIENCE INC, 2009-04-15)

We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier ...

#### 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 ...

#### Eigenclassifiers for combining correlated classifiers

(ELSEVIER SCIENCE INC, 2012-03-15)

In practice, classifiers in an ensemble are not independent. This paper is the continuation of our previous work on ensemble subset selection [A. Ulas, M. Semerci, O.T. Yildiz, E. Alpaydin, Incremental construction of ...

#### 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 ...

#### Budding Trees

(IEEE Computer Soc, 2014-08-24)

We propose a new decision tree model, named the budding tree, where a node can be both a leaf and an internal decision node. Each bud node starts as a leaf node, can then grow children, but then later on, if necessary, its ...

#### Searching for the Optimal Ordering of Classes in Rule Induction

(IEEE, 2012)

Rule induction algorithms such as Ripper, solve a K > 2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in the order of increasing ...

#### Regularizing soft decision trees

(SPRINGER, 2013)

Recently, we have proposed a new decision tree family called soft decision trees where a node chooses both its left and right children with different probabilities as given by a gating function, different from a hard ...

#### WikiLeaks on the Middle East: Obscure Diplomacy Networks and Binding Spaces

(ROUTLEDGE JOURNALS, 2014-10-02)

In this paper, we explore the flow of information regarding strategic Middle Eastern countries in the WikiLeaks 'diplomatic cables' by applying data-mining techniques to construct directed networks. The results show that ...