MF - Makale Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering

Bu koleksiyon için kalıcı URI

https://hdl.handle.net/11729/61

Listeleniyor 1 - 20 / 68

Mitosis detection using generic features and an ensemble of cascade adaboosts
(Elsevier, 2013-05-30) Tek, Faik Boray
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 generic features and an ensemble of cascade adaboosts to the automated mitosis detection. Calculation of the features rely minimally on object -level descriptions and thus require minimal segmentation. Materials and Methods: The proposed work was developed and tested on International Conference on Pattern Recognition (ICPR) 2012 mitosis detection contest data. Statistical Analysis Used: We plotted receiver operating characteristics curves of true positive versus false positive rates; calculated recall, precision, F -measure, and region overlap ratio measures. Results: We tested our features with two different classifier configurations: 1)An ensemble of single adaboosts, 2) an ensemble of cascade adaboosts. On the ICPR 2012 mitosis detection contest evaluation, the cascade ensemble scored 54, 62.7, and 58, whereas the non -cascade version scored 68, 28.1, and 39.7 for the recall, precision, and F -measure measures, respectively. Mostly used features in the adaboost classifier rules were a shape?based feature, which counted granularity and a color-based feature, which relied on Red, Green, and Blue channel statistics. Conclusions: The features, which express the granular structure and color variations, are found useful for mitosis detection. The ensemble of adaboosts performs better than the individual adaboost classifiers. Moreover, the ensemble of cascaded adaboosts was better than the ensemble of single adaboosts for mitosis detection.
A novel hybrid edge detection technique: ABC-FA
(ISRES Organizasyon Turizm Eğitim Danışmanlık Ltd. Şti., 2017-11-09) Yelmenoğlu, Elif Deniz; Çelebi, Numan; Taşçı, Tuğrul
Image processing is a vast research field with diversified set of practices utilized in so many application areas such as military, security, medical imaging, machine learning and computer vision based on extracted useful information from any kind of image data. Edges within images are undoubtedly accepted as one of the most significant features providing substantial practical information for various applications working on top of miscellaneous optimization algorithms to achieve better results. Artificial Bee Colony and Firefly algorithms are recently developed optimization algorithms and are used to obtain better results for various problems. In this study, a novel hybrid optimization technique is proposed by combining those algorithms aiming better quality in edge detection on grayscale images. The performance of the proposed algorithm is compared with individual performances of Artificial Bee Colony algorithm and the fundamental edge detection methods. The results are demonstrated that the proposed method is encouraging and also produces meaningful results for similar applications.
Programlamaya giriş dersini alan öğrencilerin programlama öz yeterlilik algılarının ve programlamaya bakış açılarının incelenmesi
(Düzce Üniversitesi, 2021-05-29) Benli, Kristin Surpuhi; Tek, Faik Boray
Bu çalışmada üniversite öğrencilerinin Java programlama öz yeterlilik algıları, programlama öğrenme istekleri ve çalışma alışkanlıkları çeşitli değişkenlere göre (cinsiyet, bölüm, eğitim dili, harf notu, ders tekrarları vb.) istatistiksel yöntemler kullanılarak (T-testi, Mann Whitney U-testi, Kruskal Wallis H testi, tek yönlü varyans analizi, Ki-Kare testi) incelenmiştir. Çalışma grubu, farklı bölümlerde zorunlu olarak programlamaya giriş dersini alan 191 lisans öğrencisinden oluşmaktadır. Elde edilen sonuçlara göre öğrencilerin Java programlama öz yeterlilik algıları bölümlerine ve programlama öğrenme isteklerine göre farklılaşmaktadır. Çalışmada ayrıca Apriori algoritması kullanılarak birliktelik kuralları çıkartılmıştır. En yüksek güven değeri elde edilen kurala göre, programlama öğrenmeyi çok fazla isteyen, programlama öğrenmenin iş hayatında kendisine fayda sağlayacağını düşünen ve programlama dersinden başarı ile geçen öğrencilerin programlama öz yeterlilikleri yüksektir.
From past to present: spam detection and identifying opinion leaders in social networks
(Yildiz Teknik Univ., 2022-06-22) Altınel Girgin, Ayşe Berna; Gümüşçekiçci, Gizem
On microblogging sites, which are gaining more and more users every day, a wide range of ideas are quickly emerging, spreading, and creating interactive environments. In some cases, in Turkey as well as in the rest of the world, it was noticed that events were published on microblogging sites before appearing in visual, audio and printed news sources. Thanks to the rapid flow of information in social networks, it can reach millions of people in seconds. In this context, social media can be seen as one of the most important sources of information affecting public opinion. Since the information in social networks became accessible, research started to be conducted using the information on the social networks. While the studies about spam detection and identification of opinion leaders gained popularity, surveys about these topics began to be published. This study also shows the importance of spam detection and identification of opinion leaders in social networks. It is seen that the data collected from social platforms, especially in recent years, has sourced many state-of-art applications. There are independent surveys that focus on filtering the spam content and detecting influencers on social networks. This survey analyzes both spam detection studies and opinion leader identification and categorizes these studies by their methodologies. As far as we know there is no survey that contains approaches for both spam detection and opinion leader identification in social networks. This survey contains an overview of the past and recent advances in both spam detection and opinion leader identification studies in social networks. Furthermore, readers of this survey have the opportunity of understanding general aspects of different studies about spam detection and opinion leader identification while observing key points and comparisons of these studies.
ComStreamClust: a communicative multi-agent approach to text clustering in streaming data
(Springer Science and Business Media Deutschland GmbH, 2023-12) Najafi, Ali; Gholipour-Shilabin, Araz; Dehkharghani, Rahim; Mohammadpur-Fard, Ali; Asgari-Chenaghlu, Meysam
Topic detection is the task of determining and tracking hot topics in social media. Twitter is arguably the most popular platform for people to share their ideas with others about different issues. One such prevalent issue is the COVID-19 pandemic. Detecting and tracking topics on these kinds of issues would help governments and healthcare companies deal with this phenomenon. In this paper, we propose a novel, multi-agent, communicative clustering approach, so-called ComStreamClust for clustering sub-topics inside a broader topic, e.g., the COVID-19 and the FA CUP. The proposed approach is parallelizable, and can simultaneously handle several data-point. The LaBSE sentence embedding is used to measure the semantic similarity between two tweets. ComStreamClust has been evaluated by several metrics such as keyword precision, keyword recall, and topic recall. Based on topic recall on different number of keywords, ComStreamClust obtains superior results when compared to the existing methods.
Closeness and uncertainty aware adversarial examples detection in adversarial machine learning
(Elsevier Ltd, 2022-07) Tuna, Ömer Faruk; Çatak, Ferhat Özgür; Eskil, Mustafa Taner
While deep learning models are thought to be resistant to random perturbations, it has been demonstrated that these architectures are vulnerable to deliberately crafted perturbations, albeit being quasi-imperceptible. These vulnerabilities make it challenging to deploy Deep Neural Network (DNN) models in security-critical areas. Recently, many research studies have been conducted to develop defense techniques enabling more robust models. In this paper, we target detecting adversarial samples by differentiating them from their clean equivalents. We investigate various metrics for detecting adversarial samples. We first leverage moment-based predictive uncertainty estimates of DNN classifiers derived through Monte-Carlo (MC) Dropout Sampling. We also introduce a new method that operates in the subspace of deep features obtained by the model. We verified the effectiveness of our approach on different datasets. Our experiments show that these approaches complement each other, and combined usage of all metrics yields 99 % ROC-AUC adversarial detection score for well-known attack algorithms.
Battle Royale Optimizer for solving binary optimization problems
(Elsevier B.V., 2022-05) Akan, Taymaz; Agahian, Saeid; Dehkharghani, Rahim
Battle Royale Optimizer (BRO) is a recently proposed metaheuristic optimization algorithm used only in continuous problem spaces. The BinBRO is a binary version of BRO. The BinBRO algorithm employs a differential expression, which utilizes a dissimilarity measure between binary vectors instead of a vector subtraction operator, used in the original BRO algorithm to find the nearest neighbor. To evaluate BinBRO, we applied it to two popular benchmark datasets: the uncapacitated facility location problem (UFLP) and the maximum-cut (Max-Cut) graph problems from OR-Library. An open-source MATLAB implementation of BinBRO is available on CodeOcean and GitHub websites.
Uncertainty as a Swiss army knife: new adversarial attack and defense ideas based on epistemic uncertainty
(Springer, 2022-04-02) Tuna, Ömer Faruk; Çatak, Ferhat Özgür; Eskil, Mustafa Taner
Although state-of-the-art deep neural network models are known to be robust to random perturbations, it was verified that these architectures are indeed quite vulnerable to deliberately crafted perturbations, albeit being quasi-imperceptible. These vulnerabilities make it challenging to deploy deep neural network models in the areas where security is a critical concern. In recent years, many research studies have been conducted to develop new attack methods and come up with new defense techniques that enable more robust and reliable models. In this study, we use the quantified epistemic uncertainty obtained from the model's final probability outputs, along with the model's own loss function, to generate more effective adversarial samples. And we propose a novel defense approach against attacks like Deepfool which result in adversarial samples located near the model's decision boundary. We have verified the effectiveness of our attack method on MNIST (Digit), MNIST (Fashion) and CIFAR-10 datasets. In our experiments, we showed that our proposed uncertainty-based reversal method achieved a worst case success rate of around 95% without compromising clean accuracy.
k-Means clustering by using the calculated Z-scores from QEEG data of children with dyslexia
(Taylor & Francis, 2023) Eroğlu, Günet; Arman, Fehim
Learning the subtype of dyslexia may help shorten the rehabilitation process and focus more on the relevant special education or diet for children with dyslexia. For this purpose, the resting-state eyes-open 2-min QEEG measurement data were collected from 112 children with dyslexia (84 male, 28 female) between 7 and 11 years old for 96 sessions per subject on average. The z-scores are calculated for each band power and each channel, and outliers are eliminated afterward. Using the k-Means clustering method, three different clusters are identified. Cluster 1 (19% of the cases) has positive z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers in all channels. Cluster 2 (76% of the cases) has negative z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers in all channels. Cluster 3 (5% of the cases) has positive z-scores for theta, alpha, beta-1, beta-2, and gamma-band powers at AF3, F3, FC5, and T7 channels and mostly negative z-scores for other channels. In Cluster 3, there is temporal disruption which is a typical description of dyslexia. In Cluster 1, there is a general brain inflammation as both slow and fast waves are detected in the same channels. In Cluster 2, there is a brain maturation delay and a mild inflammation. After Auto Train Brain training, most of the cases resemble more of Cluster 2, which may mean that inflammation is reduced and brain maturation delay comes up to the surface which might be the result of inflammation. Moreover, Cluster 2 center values at the posterior parts of the brain shift toward the mean values at these channels after 60 sessions. It means, Auto Train Brain training improves the posterior parts of the brain for children with dyslexia, which were the most relevant regions to be strengthened for dyslexia.
Exploiting epistemic uncertainty of the deep learning models to generate adversarial samples
(Springer, 2022-03) Tuna, Ömer Faruk; Çatak, Ferhat Özgür; Eskil, Mustafa Taner
Deep neural network (DNN) architectures are considered to be robust to random perturbations. Nevertheless, it was shown that they could be severely vulnerable to slight but carefully crafted perturbations of the input, termed as adversarial samples. In recent years, numerous studies have been conducted in this new area called ``Adversarial Machine Learning” to devise new adversarial attacks and to defend against these attacks with more robust DNN architectures. However, most of the current research has concentrated on utilising model loss function to craft adversarial examples or to create robust models. This study explores the usage of quantified epistemic uncertainty obtained from Monte-Carlo Dropout Sampling for adversarial attack purposes by which we perturb the input to the shifted-domain regions where the model has not been trained on. We proposed new attack ideas by exploiting the difficulty of the target model to discriminate between samples drawn from original and shifted versions of the training data distribution by utilizing epistemic uncertainty of the model. Our results show that our proposed hybrid attack approach increases the attack success rates from 82.59% to 85.14%, 82.96% to 90.13% and 89.44% to 91.06% on MNIST Digit, MNIST Fashion and CIFAR-10 datasets, respectively.
BinBRO: Binary Battle Royale Optimizer algorithm
(Elsevier Ltd, 2022-02-04) (Rahkar Farshi), Taymaz Akan; Agahian, Saeid; Dehkharghani, Rahim
Stochastic methods attempt to solve problems that cannot be solved by deterministic methods with reasonable time complexity. Optimization algorithms benefit from stochastic methods; however, they do not guarantee to obtain the optimal solution. Many optimization algorithms have been proposed for solving problems with continuous nature; nevertheless, they are unable to solve discrete or binary problems. Adaptation and use of continuous optimization algorithms for solving discrete problems have gained growing popularity in recent decades. In this paper, the binary version of a recently proposed optimization algorithm, Battle Royale Optimization, which we named BinBRO, has been proposed. The proposed algorithm has been applied to two benchmark datasets: the uncapacitated facility location problem, and the maximum-cut graph problem, and has been compared with 6 other binary optimization algorithms, namely, Particle Swarm Optimization, different versions of Genetic Algorithm, and different versions of Artificial Bee Colony algorithm. The BinBRO-based algorithms could rank first among those algorithms when applying on all benchmark datasets of both problems, UFLP and Max-Cut.
On the online coalition structure generation problem
(AI Access Foundationusc Information Sciences Inst, 2021) Flammini, Michele; Monaco, Gianpiero; Moscardelli, Luca; Shalom, Mordechai; Zaks, Shmuel
We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority (i.e., an online algorithm). When an agent appears, the algorithm has to decide whether to put the agent into an existing coalition or to create a new one containing, at this moment, only her. The decision is irrevocable. The objective is partitioning agents into coalitions so as to maximize the resulting social welfare that is the sum of all coalition values. We consider two cases for the value of a coalition: (1) the sum of the weights of its edges, and (2) the sum of the weights of its edges divided by its size. Coalition structures appear in a variety of application in AI, multi-agent systems, networks, as well as in social networks, data analysis, computational biology, game theory, and scheduling. For each of the coalition value functions we consider the bounded and unbounded cases depending on whether or not the size of a coalition can exceed a given value alpha. Furthermore, we consider the case of a limited number of coalitions and various weight functions for the edges, i.e., unrestricted, positive and constant weights. We show tight or nearly tight bounds for the competitive ratio in each case.
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04) Boyacı, Arman; Ekim, Tınaz; Shalom, Mordechai
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 parameterized complexity of this problem. We show that the maximum cardinality cut problem in proper/unit interval graphs is FPT when parameterized by the maximum number of non-empty bubbles in a column of its bubble model. We then generalize this result to a more general graph class by defining new parameters related to the well-known clique-width parameter. Specifically, we define an (?,?,?)-clique-width decomposition of a graph as a clique-width decomposition in which at each step the following invariant is preserved: after discarding at most ? labels, a) every label consists of at most ? sets of twin vertices, and b) all the labels together induce a graph with independence number at most ?. We show that for every two constants ?,?>0 the problem is FPT when parameterized by ? plus the smallest width of an (?,?,?)-clique-width decomposition.
Unsupervised textile defect detection using convolutional neural networks
(Elsevier Ltd, 2021-12) Koulali, Imane; Eskil, Mustafa Taner
In this study, we propose a novel motif-based approach for unsupervised textile anomaly detection that combines the benefits of traditional convolutional neural networks with those of an unsupervised learning paradigm. It consists of five main steps: preprocessing, automatic pattern period extraction, patch extraction, features selection and anomaly detection. This proposed approach uses a new dynamic and heuristic method for feature selection which avoids the drawbacks of initialization of the number of filters (neurons) and their weights, and those of the backpropagation mechanism such as the vanishing gradients, which are common practice in the state-of-the-art methods. The design and training of the network are performed in a dynamic and input domain-based manner and, thus, no ad-hoc configurations are required. Before building the model, only the number of layers and the stride are defined. We do not initialize the weights randomly nor do we define the filter size or number of filters as conventionally done in CNN-based approaches. This reduces effort and time spent on hyper-parameter initialization and fine-tuning. Only one defect-free sample is required for training and no further labeled data is needed. The trained network is then used to detect anomalies on defective fabric samples. We demonstrate the effectiveness of our approach on the Patterned Fabrics benchmark dataset. Our algorithm yields reliable and competitive results (on recall, precision, accuracy and f1-measure) compared to state-of-the-art unsupervised approaches, in less time, with efficient training in a single epoch and a lower computational cost.
A mobile app that uses neurofeedback and multi-sensory learning methods improves reading abilities in dyslexia: a pilot study
(Routledge, 2022-07-03) Eroğlu, Günet; Teber, Serap Tıraş; Ertürk, Kardelen; Kırmızı, Meltem; Ekici, Barış; Arman, Fehim; Balcısoy, Selim Saffet; Özcan, Yusuf Ziya; Çetin, Müjdat
Reading comprehension is difficult to improve for children with dyslexia because of the continuing demands of orthographic decoding in combination with limited working memory capacity. Children with dyslexia get special education that improves spelling, phonemic and vocabulary awareness, however the latest research indicated that special education does not improve reading comprehension. With the aim of improving reading comprehension, reading speed and all other reading abilities of children with dyslexia, Auto Train Brain that is a novel mobile app using neurofeedback and multi-sensory learning methods was developed. With a clinical study, we wanted to demonstrate the effectiveness of Auto Train Brain on reading abilities. We compared the cognitive improvements obtained with Auto Train Brain with the improvements obtained with special dyslexia training. Auto Train Brain was applied to 16 children with dyslexia 60 times for 30 minutes. The control group consisted of 14 children with dyslexia who did not have remedial training with Auto Train Brain, but who did continue special education. The TILLS test was applied to both the experimental and the control group at the beginning of the experiment and after a 6-month duration from the first TILLS test. Comparison of the pre- and post- TILLS test results indicated that applying neurofeedback and multi-sensory learning method improved reading comprehension of the experimental group more than that of the control group statistically significantly. Both Auto Train Brain and special education improved phonemic awareness and nonword spelling.
Adaptive convolution kernel for artificial neural networks
(Academic Press Inc., 2021-02) Tek, Faik Boray; Çam, İlker; Karlı, Deniz
Many deep neural networks are built by using stacked convolutional layers of fixed and single size (often 3 × 3) kernels. This paper describes a method for learning the size of convolutional kernels to provide varying size kernels in a single layer. The method utilizes a differentiable, and therefore backpropagation-trainable Gaussian envelope which can grow or shrink in a base grid. Our experiments compared the proposed adaptive layers to ordinary convolution layers in a simple two-layer network, a deeper residual network, and a U-Net architecture. The results in the popular image classification datasets such as MNIST, MNIST-CLUTTERED, CIFAR-10, Fashion, and ‘‘Faces in the Wild’’ showed that the adaptive kernels can provide statistically significant improvements on ordinary convolution kernels. A segmentation experiment in the Oxford-Pets dataset demonstrated that replacing ordinary convolution layers in a U-shaped network with 7 × 7 adaptive layers can improve its learning performance and ability to generalize.
Improved microphone array design with statistical speaker verification
(Elsevier Ltd, 2021-04) Demir, Kadir Erdem; Eskil, Mustafa Taner
Conventional microphone array implementations aim to lock onto a source with given location and if required, tracking it. It is a challenge to identify the intended source when the location of the source is unknown and interference exists in the same environment. In this study we combine speaker verification and microphone array processing techniques to localize and maximize gain on the intended speaker under the assumption of open acoustic field. We exploit the steering capability of the microphone array for more accurate speaker verification. Our first contribution is a new N-Gram based and computationally efficient feature for detecting an intended speaker. When the source and interference are localized, microphone array can be tuned further to reduce noise and increase the gain. Our second contribution is this integrated algorithm for speaker verification and localization. In the context of this study we developed SharpEar, an open source environment that simulates propagation of sound emanating from multiple sources. Our third and last contribution is this simulation environment, which is open source and available to researchers of the field.
Türkçe WordNet oluşturulması ve makine çevirisinde kullanılması
Uyarlanır yerel bağlı nöron modelinin incelemesi
(Gazi Üniversitesi Bilişim Enstitüsü, 2019-04-10) Tek, Faik Boray
Bu çalışmada uyarlanır yerel bağlı (odaklanan) nöron modelinin bir incelemesi sunulmuştur. Öncelikle bu modelin varolan diğer nöron modelleri ile ilişkisi incelenmiştir. Daha sonra modelin ileri beslemede çalışması ve geriye yayılım ile eğitilmesi tartışılmıştır. Modelin çalışma prensipleri sentetik sınıflandırma veri kümeleri üzerinde deneylerle gösterilmiştir. Son olarak, basit ve evrişimli ağların saklı katmanlarında odaklı nöronlar kullanılması halinde tam bağlı nöronlara göre daha iyi bir performans elde edilebileceği MNIST, CIFAR10, FASHION gibi popüler imge tanıma veri kümelerinde karşılaştırmalı olarak gösterilmiştir.
Crossing minimization in weighted bipartite graphs
(Elsevier B.V., 2009-12) Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The problem is NP-complete in general and several practically efficient heuristics and polynomial-time algorithms with a constant approximation ratio have been suggested. We generalize the problem and consider the version where the edges have nonnegative weights. Although this problem is more general and finds specific applications in automatic graph layout problems similar to those of the unweighted case, it has not received as much attention. We provide a new technique that efficiently approximates a solution to this more general problem within a constant approximation ratio of 3. In addition we provide appropriate generalizations of some common heuristics usually employed for the unweighted case and compare their performances.

Güncel Gönderiler