Yayın tarihi için MF - Makale Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 68, listelenen: 21-40
-
Colored simultaneous geometric embeddings and universal pointsets
(Springer, 2011-07)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 ... -
Breaking an orbit-based symmetric cryptosystem
(Pergamon-Elsevier Science Ltd, 2011-09)We report a break for a recently proposed class of cryptosystems. The cryptosystem uses constant points of a periodic secret orbit to encrypt the plaintext. In order to break the system, it suffices to sort the constant ... -
Student conference as a student centred environment for integrating technical writings into computer engineering curriculum
(Anı Yayıncılık, 2011-12)Problem Statement: In today's world there are pressures on universities to ensure that graduates have the capacity to meet the needs of employers. One aspect of this is to ensure that students, along with professional ... -
Model selection in omnivariate decision trees using Structural Risk Minimization
(Elsevier Science Inc, 2011-12-01)As opposed to trees that use a single type of decision node, an omnivariate decision tree contains nodes of different types. We propose to use Structural Risk Minimization (SRM) to choose between node types in omnivariate ... -
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 ... -
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 ... -
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 ... -
A hybrid approach to private record matching
(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 ... -
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 ... -
Mitosis detection using generic features and an ensemble of cascade adaboosts
(Elsevier, 2013-05-30)Context: Mitosis count is one of the factors that pathologists use to assess the risk of metastasis and survival of the patients, which are affected by the breast cancer. Aims: We investigate an application of a set of ... -
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 ... -
Nearest neighbor weighted average customization for modeling faces
(Springer, 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 ... -
Software defect prediction using Bayesian networks
(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 ... -
Facial expression recognition based on anatomy
(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 ... -
On the feature extraction in discrete space
(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
(Elsevier Science BV, 2014-09)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
(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 ... -
Assessment of algorithms for mitosis detection in breast cancer histopathology images
(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. ... -
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 ... -
Quadratic programming for class ordering in rule induction
(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 ...