Search
Now showing items 1-10 of 69
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 ...
VC-dimension of univariate decision trees
(IEEE-INST Electrical Electronics Engineers Inc, 2015-02-25)
In this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension ...
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 ...
An all-words sense annotated Turkish corpus
(IEEE, 2018-06-06)
This paper reports our efforts in constructing of a sense labeled Turkish corpus with respect to Turkish Language Institution's dictionary, using the traditional method of manual tagging. We tagged a pre-built parallel ...
On the VC-dimension of univariate decision trees
(2012)
In this paper, we give and prove lower bounds of the VC-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and ...
Constructing a Turkish constituency parse treeBank
(Springer Verlag, 2016)
In this paper, we describe our initial efforts for creating a Turkish constituency parse treebank by utilizing the English Penn Treebank. We employ a semiautomated approach for annotation. In our previouswork [18], the ...
An incremental model selection algorithm based on cross-validation for finding the architecture of a Hidden Markov model on hand gesture data sets
(IEEE, 2009-12-13)
In a multi-parameter learning problem, besides choosing the architecture of the learner, there is the problem of finding the optimal parameters to get maximum performance. When the number of parameters to be tuned increases, ...
Parallel univariate decision trees
(Elsevier B.V, 2007-05-01)
Univariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the ...
Calculating the VC-dimension of decision trees
(IEEE, 2009)
We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the ...
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 ...