Ara
Toplam kayıt 51, listelenen: 11-20
Design and analysis of classifier learning experiments in bioinformatics: survey and case studies
(IEEE Computer Soc, 2012-12)
In many bioinformatics applications, it is important to assess and compare the performances of algorithms trained from data, to be able to draw conclusions unaffected by chance and are therefore significant. Both the design ...
Cryptanalysis of Fridrich's chaotic image encryption
(World Scientific Publishing, 2010-05)
We cryptanalyze Fridrich's chaotic image encryption algorithm. We show that the algebraic weaknesses of the algorithm make it vulnerable against chosen-ciphertext attacks. We propose an attack that reveals the secret ...
Tree Ensembles on the induced discrete space
(Institute of Electrical and Electronics Engineers Inc., 2016-05)
Decision trees are widely used predictive models in machine learning. Recently, K-tree is proposed, where the original discrete feature space is expanded by generating all orderings of values of k discrete attributes and ...
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 ...
English-Turkish parallel treebank with morphological annotations and its use in tree-based SMT
(SciTePress, 2016)
In this paper, we report our tree based statistical translation study from English to Turkish. We describe our data generation process and report the initial results of tree-based translation under a simple model. For ...
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 ...
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 ...