Ara
Toplam kayıt 10, listelenen: 1-10
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 ...
Aynı oteli temsil eden farklı kayıtlar için akıllı eşleştirme
(Institute of Electrical and Electronics Engineers Inc., 2019-09)
Otel sayısının her geçen gün arttığı turizm sektöründe, aracı firmaların tüm oteller ile ayrı ayrı çalışma imkanı bulunmadığından, firmalar dünya üzerinde bir çok otelle anlaşması bulunan servis sağlayıcılarıyla beraber ...
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.
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 ...
İlişkisel veri tabanlarında mükerrer kayıtların makine öǧrenmesiyle tespiti
(Institute of Electrical and Electronics Engineers Inc., 2018-07-05)
Veri miktarının artışına paralel olarak, ilişkisel veri tabanlarında mükerrer kayıtlar da artmaktadır. Artan bu kayıtlar kullanıldıkları rapor veya analizlerde tutarsızlığa sebep olabilmektedir. Bu sorunu en aza indirgemek ...
Omnivariate rule induction using a novel pairwise statistical test
(IEEE Computer Soc, 2013-09)
Rule learning algorithms, for example, RIPPER, induces univariate rules, that is, a propositional condition in a rule uses only one feature. In this paper, we propose an omnivariate induction of rules where under each ...
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 ...
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 ...
Creating a syntactically felicitous constituency treebank for Turkish
(Institute of Electrical and Electronics Engineers Inc., 2020-10-15)
In this study, Bakay et. al [1] and Yildiz et. al.'s [2] work on Turkish constituency treebanks were developed further. Compared to the previous work, the most prominent feature of this study is the fact that every annotation ...