Ara
Toplam kayıt 63, listelenen: 1-10
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 ...
English-Turkish parallel semantic annotation of Penn-Treebank
(Oficyna Wydawnicza Politechniki Wroclawskiej, 2020)
This paper reports our efforts in constructing a sense-labeled English-Turkish parallel corpus using the traditional method of manual tagging. We tagged a pre-built parallel treebank which was translated from the Penn ...
An open, extendible, and fast Turkish morphological analyzer
(Incoma Ltd, 2019-09)
In this paper, we present a two-level morphological analyzer for Turkish which consists of five main components: finite state transducer, rule engine for suffixation, lexicon, trie data structure, and LRU cache. We use ...
Comparing sense categorization between English propbank and english wordnet
(Oficyna Wydawnicza Politechniki Wroclawskiej, 2020)
Given the fact that verbs play a crucial role in language comprehension, this paper presents a study which compares the verb senses in English PropBank with the ones in English WordNet through manual tagging. After analyzing ...
Statistical tests using hinge/ε-sensitive loss
(Springer-Verlag, 2013)
Statistical tests used in the literature to compare algorithms use the misclassification error which is based on the 0/1 loss and square loss for regression. Kernel-based, support vector machine classifiers (regressors) ...
A novel regression method for software defect prediction with kernel methods
(2013)
In this paper, we propose a novel method based on SVM to predict the number of defects in the files or classes of a software system. To model the relationship between source code similarity and defectiveness, we use SVM ...
Bilingual software requirements tracing using vector space model
(SciTePress, 2014)
In the software engineering world, creating and maintaining relationships between byproducts generated during the software lifecycle is crucial. A typical relation is the one that exists between an item in the requirements ...
Feature extraction from discrete attributes
(IEEE, 2010)
In many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we extract new features by combining k discrete attributes, where for each ...
Univariate margin tree
(Springer, 2010)
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 ...
Multivariate statistical tests for comparing classification algorithms
(Springer, Berlin, Heidelberg, 2011)
The misclassification error which is usually used in tests to compare classification algorithms, does not make a distinction between the sources of error, namely, false positives and false negatives. Instead of summing ...