Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Impact Of Image Segmentation Techniques On Celiac Disease Classification Usingscale Invariant Texture Descriptors For Standard Flexible Endoscopic Systems, Manarbek Saken, Munkhtsetseg Banzragch Yağci, Nejat Yumuşak
Impact Of Image Segmentation Techniques On Celiac Disease Classification Usingscale Invariant Texture Descriptors For Standard Flexible Endoscopic Systems, Manarbek Saken, Munkhtsetseg Banzragch Yağci, Nejat Yumuşak
Turkish Journal of Electrical Engineering and Computer Sciences
Celiac disease (CD) is quite common and is a proximal small bowel disease that develops as a permanentintolerance to gluten and other cereal proteins in cereals. It is considered as one of the most di?icult diseases to diagnose.Histopathological evidence of small bowel biopsies taken during endoscopy remains the gold standard for diagnosis.Therefore, computer-aided detection (CAD) systems in endoscopy are a newly emerging technology to enhance thediagnostic accuracy of the disease and to save time and manpower. For this reason, a hybrid machine learning methodshave been applied for the CAD of celiac disease. Firstly, a context-based optimal multilevel thresholding technique wasemployed …
An Improved Version Of Multi-View K-Nearest Neighbors (Mvknn) For Multipleview Learning, Eli̇fe Öztürk Kiyak, Derya Bi̇rant, Kökten Ulaş Bi̇rant
An Improved Version Of Multi-View K-Nearest Neighbors (Mvknn) For Multipleview Learning, Eli̇fe Öztürk Kiyak, Derya Bi̇rant, Kökten Ulaş Bi̇rant
Turkish Journal of Electrical Engineering and Computer Sciences
Multi-view learning (MVL) is a special type of machine learning that utilizes more than one views, where views include various descriptions of a given sample. Traditionally, classification algorithms such as k-nearest neighbors (KNN) are designed for learning from single-view data. However, many real-world applications involve datasets with multiple views and each view may contain different and partly independent information, which makes the traditional single-view classification approaches ineffective. Therefore, this article proposes an improved MVL algorithm, called multi-view k-nearest neighbors (MVKNN), based on the existing KNN algorithm. The experimental results conducted in this research show that a significant improvement is achieved …
A New Approach: Semisupervised Ordinal Classification, Ferda Ünal, Derya Bi̇rant, Özlem Şeker
A New Approach: Semisupervised Ordinal Classification, Ferda Ünal, Derya Bi̇rant, Özlem Şeker
Turkish Journal of Electrical Engineering and Computer Sciences
Semisupervised learning is a type of machine learning technique that constructs a classifier by learning from a small collection of labeled samples and a large collection of unlabeled ones. Although some progress has been made in this research area, the existing semisupervised methods provide a nominal classification task. However, semisupervised learning for ordinal classification is yet to be explored. To bridge the gap, this study combines two concepts ?semisupervised learning? and "ordinal classification" for the categorical class labels for the first time and introduces a new concept of "semisupervised ordinal classification". This paper proposes a new algorithm for semisupervised learning …
A Linear Programming Approach To Multiple Instance Learning, Emel Şeyma Küçükaşci, Mustafa Gökçe Baydoğan, Zeki̇ Caner Taşkin
A Linear Programming Approach To Multiple Instance Learning, Emel Şeyma Küçükaşci, Mustafa Gökçe Baydoğan, Zeki̇ Caner Taşkin
Turkish Journal of Electrical Engineering and Computer Sciences
Multiple instance learning (MIL) aims to classify objects with complex structures and covers a wide range of real-world data mining applications. In MIL, objects are represented by a bag of instances instead of a single instance, and class labels are provided only for the bags. Some of the earlier MIL methods focus on solving MIL problem under the standard MIL assumption, which requires at least one positive instance in positive bags and all remaining instances are negative. This study proposes a linear programming framework to learn instance level contributions to bag label without emposing the standart assumption. Each instance of …
Diagnosis Of Paroxysmal Atrial Fibrillation From Thirty-Minute Heart Ratevariability Data Using Convolutional Neural Networks, Murat Sürücü, Yalçin İşler, Resul Kara
Diagnosis Of Paroxysmal Atrial Fibrillation From Thirty-Minute Heart Ratevariability Data Using Convolutional Neural Networks, Murat Sürücü, Yalçin İşler, Resul Kara
Turkish Journal of Electrical Engineering and Computer Sciences
Paroxysmal atrial fibrillation (PAF) is the initial stage of atrial fibrillation, one of the most common arrhythmia types. PAF worsens with time and affects the patient?s life quality negatively. In this study, we aimed to diagnose PAF early, so patients can start taking precautions before this disease gets worse. We used the atrial fibrillation prediction database, an open data from Physionet and constructed our approach using convolutional neural networks. Heart rate variability (HRV) features are calculated from time-domain measures, frequency-domain measures using power spectral density estimations (fast Fourier transform, Lomb-Scargle, and Welch periodogram), time-frequencydomain measures using wavelet transform, and nonlinear …
The Nearest Polyhedral Convex Conic Regions For High-Dimensional Classification, Hakan Çevi̇kalp, Emre Çi̇men, Gürkan Öztürk
The Nearest Polyhedral Convex Conic Regions For High-Dimensional Classification, Hakan Çevi̇kalp, Emre Çi̇men, Gürkan Öztürk
Turkish Journal of Electrical Engineering and Computer Sciences
In the nearest-convex-model type classifiers, each class in the training set is approximated with a convexclass model, and a test sample is assigned to a class based on the shortest distance from the test sample to these classmodels. In this paper, we propose new methods for approximating the distances from test samples to the convex regionsspanned by training samples of classes. To this end, we approximate each class region with a polyhedral convex conicregion by utilizing polyhedral conic functions (PCFs) and its extension, extended PCFs. Then, we derive the necessary formulations for computing the distances from test samples to these …