Ara
Toplam kayıt 51, listelenen: 11-20
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 ...
A novel kernel to predict software defectiveness
(Elsevier Science Inc, 2016-09)
Although the software defect prediction problem has been researched for a long time, the results achieved are not so bright. In this paper, we propose to use novel kernels for defect prediction that are based on the ...
Software defect prediction using Bayesian networks
(Springer, 2014-02)
There are lots of different software metrics discovered and used for defect prediction in the literature. Instead of dealing with so many metrics, it would be practical and easy if we could determine the set of metrics ...
Quadratic programming for class ordering in rule induction
(Elsevier Science BV, 2015-03-01)
Separate-and-conquer type 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 ...
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 ...
On the feature extraction in discrete space
(Elsevier Sci Ltd, 2014-05)
In many pattern recognition applications, feature space expansion is a key step for improving the performance of the classifier. In this paper, we (i) expand the discrete feature space by generating all orderings of values ...
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 ...
Chunking in Turkish with conditional random fields
(Springer-Verlag, 2015-04-14)
In this paper, we report our work on chunking in Turkish. We used the data that we generated by manually translating a subset of the Penn Treebank. We exploited the already available tags in the trees to automatically ...
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 ...