Güncel Gönderiler

  • Modeling and simulation support to the defense planning process 

    Çayırcı, Erdal; Özçakır, Lütfü (SAGE Publications Inc., 2017-04-01)
    Defense planning is a crucial part of the defense process. It identifies the capabilities required for the future defense environment, analyzes the capability shortfalls, prioritizes them, and provides the fundamental ...
  • A novel kernel to predict software defectiveness 

    Yıldız, Olcay Taner (Elsevier Science Inc., 2016-09)
    Although the software defect prediction problem has been researched for a long time, the results achieved are not so bright. In this paper, we propose to use novel kernels for defect prediction that are based on the ...
  • Tree Ensembles on the Induced Discrete Space 

    Yıldız, Olcay Taner (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 ...
  • Cryptanalysis of image encryption with compound chaotic sequence 

    Solak, Ercan (IEEE, 2009)
    Recently, an image encryption algorithm based on compound chaotic sequence was proposed [Tong et al., Image and Vision Computing 26 (2008) 843]. In this paper, we analyze the security weaknesses of the proposal. We give ...
  • Passion of chaotic cryptography 

    Solak, Ercan (IEEE, 2013)
    Despite being an active research area for the last two decades, chaotic cryptography has not found a place in mainstream cryptography literature. This paper explores the reasons for this separation.
  • VC-Dimension of Univariate Decision Trees 

    Yıldız, Olcay Taner (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2015-02)
    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 ...
  • Quadratic programming for class ordering in rule induction 

    Yıldız, Olcay Taner (ELSEVIER SCIENCE BV, 2015-03-01)
    Separate-and-conquer type 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 ...
  • Assessment of algorithms for mitosis detection in breast cancer histopathology images 

    Veta, Mitko; Van Diest, Paul J.; Willems, Stefan Martin; Wang, Haibo; Madabhushi, Anant; Cruz-Roa, Angel; Gonzalez, Fabio; Larsen, Anders Boesen Lindbo; Vestergaard, Jacob Schack Chack; Dahl, Anders Bjorholm; Cireşan, Dan Claudiu; Schmidhuber, Jürgen U.; Giusti, Alessandro; Gambardella, Luca M.; Tek, Faik Boray; Walter, Thomas C.; Wang, Chingwei; Kondo, Satoshi; Matuszewski, Bogdan J.; Precioso, Frédéric; Snell, Violet; Kittler, Josef; De Campos, Teofilo E.; Khan, Adnan M.; Rajpoot, Nasir Mahmood; Arkoumani, Evdokia; Lacle, Miangela M.; Viergever, Max A.; Pluim, Josien P W (ELSEVIER SCIENCE BV, 2015-02)
    The proliferative activity of breast tumors, which is routinely estimated by counting of mitotic figures in hematoxylin and eosin stained histology sections, is considered to be one of the most important prognostic markers. ...
  • Facial expression recognition based on anatomy 

    Eskil, Mustafa Taner; Benli, Kristin Surpuhi (Academic Press INC Elsevier Science, 2014-02)
    In this study, we propose a novel approach to facial expression recognition that capitalizes on the anatomical structure of the human face. We model human face with a high-polygon wireframe model that embeds all major ...
  • Software defect prediction using Bayesian networks 

    Okutan, Ahmet; Yıldız, Olcay Taner (Springer, 2014-02)
    There are lots of different software metrics discovered and used for defect prediction in the literature. Instead of dealing with so many metrics, it would be practical and easy if we could determine the set of metrics ...
  • On the feature extraction in discrete space 

    Yıldız, Olcay Taner (ELSEVIER SCI LTD., 2014-05)
    In many pattern recognition applications, feature space expansion is a key step for improving the performance of the classifier. In this paper, we (i) expand the discrete feature space by generating all orderings of values ...
  • Robust localization and identification of African clawed frogs in digital images 

    Tek, Faik Boray; Cannavo, Flavio; Nunnari, Giuseppe; Kale, İzzet (ELSEVIER SCIENCE BV, 2014-10)
    We study the automatic localization and identification of African clawed frogs (Xenopus laevis sp.) in digital images taken in a laboratory environment. We propose a novel and stable frog body localization and skin pattern ...
  • Factored particle filtering with dependent and constrained partition dynamics for tracking deformable objects 

    Eskil, Mustafa Taner (SPRINGER, 2014-10)
    In particle filtering, dimensionality of the state space can be reduced by tracking control (or feature) points as independent objects, which are traditionally named as partitions. Two critical decisions have to be made ...
  • Nearest neighbor weighted average customization for modeling faces 

    Abeysundera, Hasith Pasindu; Benli, Kristin Surpuhi; Eskil, Mustafa Taner (Springer Berlin Heidelberg, 2013-10)
    In this paper, we present an anatomically accurate generic wireframe face model and an efficient customization method for modeling human faces. We use a single 2D image for customization of the generic model. We employ ...
  • Omnivariate Rule Induction Using a Novel Pairwise Statistical Test 

    Yıldız, Olcay Taner (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 ...
  • Eigenclassifiers for combining correlated classifiers 

    Ulaş, Aydın; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (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 ...
  • Cost-conscious comparison of supervised learning algorithms over multiple data sets 

    Ulaş, Aydın; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (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 ...
  • Design and analysis of classifier learning experiments in bioinformatics: survey and case studies 

    İrsoy, Ozan; Yıldız, Olcay Taner; Alpaydın, Ahmet İbrahim Ethem (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 ...
  • A hybrid approach to private record matching 

    İnan, Ali; Kantarcıoğlu, Murat; Ghinita, Gabriel; Bertino, Elisa (IEEE COMPUTER SOC, 2012-10)
    Real-world entities are not always represented by the same set of features in different data sets. Therefore, matching records of the same real-world entity distributed across these data sets is a challenging task. If the ...
  • Colored simultaneous geometric embeddings and universal pointsets 

    Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios (SPRINGER, 2011)
    Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to ...

Daha Fazla