Ara
Toplam kayıt 168, listelenen: 131-140
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04)
Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ...
Machine learning
(Institution of Engineering and Technology, 2020-01-01)
[No abstract available]
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 ...
Eigenclassifiers for combining correlated classifiers
(Elsevier Science Inc, 2012-03-15)
In practice, classifiers in an ensemble are not independent. This paper is the continuation of our previous work on ensemble subset selection [A. Ulas, M. Semerci, O.T. Yildiz, E. Alpaydin, Incremental construction of ...
Univariate decision tree induction using maximum margin classification
(Oxford Univ Press, 2012-03)
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 ...
A novel approach to morphological disambiguation for Turkish
(Springer-Verlag, 2012)
In this paper, we propose a classification based approach to the morphological disambiguation for Turkish language. Due to complex morphology in Turkish, any word can get unlimited number of affixes resulting very large ...
Cryptanalysis of a cryptosystem based on discretized two-dimensional chaotic maps
(Elsevier Science BV, 2008-11-17)
Recently, an encryption algorithm based on two-dimensional discretized chaotic maps was proposed [Xiang et al., Phys. Lett. A 364 (2007) 252]. In this Letter, we analyze the security weaknesses of the proposal. Using the ...
Odaklanan nöron
(IEEE, 2017-06-27)
Geleneksel yapay sinir ağında topoloji eğitim sırasında değişebilecek esnekliğe sahip değildir. Ağda her bir nöron ve bağımsız bağlantı katsayıları çözüm işlevinin bir parçasıdır. Bu bildiride önerdiğimiz odaklanabilir ...
Subset selection for tuning of hyper-parameters in artificial neural networks
(IEEE, 2017)
Hyper-parameters of a machine learning architecture define its design. Tuning of hyper-parameters is costly and for large data sets outright impractical, whether it is performed manually or algorithmically. In this study ...
A new approach for named entity recognition
(IEEE, 2017)
Many sentences create certain impressions on people. These impressions help the reader to have an insight about the sentence via some entities. In NLP, this process corresponds to Named Entity Recognition (NER). NLP ...