Makale Koleksiyonu | Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Bu koleksiyon için kalıcı URI
Güncel Gönderiler
Öğe A novel similarity based unsupervised technique for training convolutional filters(IEEE, 2023-05-17) Erkoç, Tuğba; Eskil, Mustata TanerAchieving satisfactory results with Convolutional Neural Networks (CNNs) depends on how effectively the filters are trained. Conventionally, an appropriate number of filters is carefully selected, the filters are initialized with a proper initialization method and trained with backpropagation over several epochs. This training scheme requires a large labeled dataset, which is costly and time-consuming to obtain. In this study, we propose an unsupervised approach that extracts convolutional filters from a given dataset in a self-organized manner by processing the training set only once without using backpropagation training. The proposed method allows for the extraction of filters from a given dataset in the absence of labels. In contrast to previous studies, we no longer need to select the best number of filters and a suitable filter weight initialization scheme. Applying this method to the MNIST, EMNIST-Digits, Kuzushiji-MNIST, and Fashion-MNIST datasets yields high test performances of 99.19%, 99.39%, 95.03%, and 90.11%, respectively, without applying backpropagation training or using any preprocessed and augmented data.Öğe TENET: a new hybrid network architecture for adversarial defense(Springer Science and Business Media Deutschland GmbH, 2023-08) Tuna, Ömer Faruk; Çatak, Ferhat Özgür; Eskil, Mustafa TanerDeep neural network (DNN) models are widely renowned for their resistance to random perturbations. However, researchers have found out that these models are indeed extremely vulnerable to deliberately crafted and seemingly imperceptible perturbations of the input, referred to as adversarial examples. Adversarial attacks have the potential to substantially compromise the security of DNN-powered systems and posing high risks especially in the areas where security is a top priority. Numerous studies have been conducted in recent years to defend against these attacks and to develop more robust architectures resistant to adversarial threats. In this study, we propose a new architecture and enhance a recently proposed technique by which we can restore adversarial samples back to their original class manifold. We leverage the use of several uncertainty metrics obtained from Monte Carlo dropout (MC Dropout) estimates of the model together with the model’s own loss function and combine them with the use of defensive distillation technique to defend against these attacks. We have experimentally evaluated and verified the efficacy of our approach on MNIST (Digit), MNIST (Fashion) and CIFAR10 datasets. In our experiments, we showed that our proposed method reduces the attack’s success rate lower than 5% without compromising clean accuracy.Öğe A comparison of Auto Train Brain neurofeedback rewarding interfaces in terms of efficacy(Acıbadem Mehmet Ali Aydınlar Üniversitesi, 2023-01-01) Eroğlu, GünetBackground/aim: Auto Train Brain is a mobile app that was specifically developed for dyslexic children to increase their reading speed and reading comprehension. In the original mobile app, only one unique neurofeedback user interface provided visually and audibly rewarding feedback to the subject with a red-green colored arrow on the screen. Later, new modules are added to the app with the end-users requests. These are the “youtube” video-based interface and “Spotify” auditory-based interface. In this research, we have compared the efficacy of the neurofeedback rewarding interfaces. Materials and methods: The experiment group consists of 20 dyslexic children aged 7-to 10 (15 males, 5 females) who were randomly assigned to one rewarding interface and used it at home for more than six months. Results: The result indicates that though the “youtube” interface is liked most by the participants, the arrow-based simple neurofeedback interface reduces theta brain waves more than other rewarding schemes. On the other hand, “youtube” and “Spotify” based interfaces increase Beta band powers more than the arrow interfaces in the cortex. The ”Spotify” user interface improves the fast brain waves more on the temporal lobes (T7 and T8) as the feedback given was only auditory. Conclusion: The results indicate that the relevant neurofeedback rewarding interface should be chosen based on the dyslexic child’s specific condition.Öğe Distribution games: a new class of games with application to user provided networks(Institute of Electrical and Electronics Engineers Inc., 2022-11-29) Taşçı, Sinan Emre; Shalom, Mordechai; Korçak, ÖmerUser Provided Network (UPN) is a promising solution for sharing the limited network resources by utilizing user capabilities as a part of the communication infrastructure. In UPNs, it is an important problem to decide how to share the resources among multiple clients in decentralized manner. Motivated by this problem, we introduce a new class of games termed distribution games that can be used to distribute efficiently and fairly the bandwidth capacity among users. We show that every distribution game has at least one pure strategy Nash equilibrium (NE) and any best response dynamics always converges to such an equilibrium. We consider social welfare functions that are weighted sums of bandwidths allocated to clients. We present tight upper bounds for the price of anarchy and price of stability of these games provided that they satisfy some reasonable assumptions. We define two specific practical instances of distribution games that fit these assumptions. We conduct experiments on one of these instances and demonstrate that in most of the settings the social welfare obtained by the best response dynamics is very close to the optimum. Simulations show that this game also leads to a fair distribution of the bandwidth.Öğe Graph convolutional network based virus-human protein-protein interaction prediction for novel viruses(Elsevier Ltd, 2022-08-13) Koca, Mehmet Burak; Nourani, Esmaeil; Abbasoğlu, Ferda; Karadeniz, İlknur; Sevilgen, Fatih ErdoğanComputational identification of human-virus protein-protein interactions (PHIs) is a worthwhile step towards understanding infection mechanisms. Analysis of the PHI networks is important for the determination of path-ogenic diseases. Prediction of these interactions is a popular problem since experimental detection of PHIs is both time-consuming and expensive. The available methods use biological features like amino acid sequences, molecular structure, or biological activities for prediction. Recent studies show that the topological properties of proteins in protein-protein interaction (PPI) networks increase the performance of the predictions. The basic network projections, random-walk-based models, or graph neural networks are used for generating topologically enriched (hybrid) protein embeddings. In this study, we propose a three-stage machine learning pipeline that generates and uses hybrid embeddings for PHI prediction. In the first stage, numerical features are extracted from the amino acid sequences using the Doc2Vec and Byte Pair Encoding method. The amino acid embeddings are used as node features while training a modified GraphSAGE model, which is an improved version of the graph convolutional network. Lastly, the hybrid protein embeddings are used for training a binary interaction classifier model that predicts whether there is an interaction between the given two proteins or not. The proposed method is evaluated with comprehensive experiments to test its functionality and compare it with the state-of-art methods. The experimental results on the benchmark dataset prove the efficiency of the proposed model by having a 3–23% better area under curve (AUC) score than its competitors.Öğe A short proof of the size of edge-extremal chordal graphs(Mahmut Akyiğit, 2022-08-30) Shalom, MordechaiBlair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a maximum degree less than d and the matching number at most ? by exhibiting a family of chordal graphs achieving this bound. We provide simple proof of their result.Öğe Evaluating the English-Turkish parallel treebank for machine translation(TÜBİTAK, 2022-01-19) Görgün, Onur; Yıldız, Olcay TanerThis study extends our initial efforts in building an English-Turkish parallel treebank corpus for statistical machine translation tasks. We manually generated parallel trees for about 17K sentences selected from the Penn Treebank corpus. English sentences vary in length: 15 to 50 tokens including punctuation. We constrained the translation of trees by (i) reordering of leaf nodes based on suffixation rules in Turkish, and (ii) gloss replacement. We aim to mimic human annotator's behavior in real translation task. In order to fill the morphological and syntactic gap between languages, we do morphological annotation and disambiguation. We also apply our heuristics by creating Nokia English-Turkish Treebank (NTB) to address technical document translation tasks. NTB also includes 8.3K sentences in varying lengths. We validate the corpus both extrinsically and intrinsically, and report our evaluation results regarding perplexity analysis and translation task results. Results prove that our heuristics yield promising results in terms of perplexity and are suitable for translation tasks in terms of BLEU scores.
