Ara
Toplam kayıt 32, listelenen: 1-10
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 ...
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 ...
Unsupervised morphological analysis using tries
(Springer London, 2012)
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, ...
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 ...
Context sensitive search engine
(Springer-Verlag Berlin, 2014-10-27)
In this paper, we use context information extracted from the documents in the collection to improve the performance of the search engine. In first step, we extract context using Lucene, DBPedia-Spotlight, and Wordnet. As ...
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 ...
Searching for the optimal ordering of classes in rule induction
(IEEE, 2012-11-15)
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 ...
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 ...
Shallow parsing in Turkish
(IEEE, 2017)
In this study, shallow parsing is applied on Turkish sentences. These sentences are used to train and test the per-formances of various learning algorithms with various features specified for shallow parsing in Turkish.
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 ...