Variable shaped detector : a negative selection algorithm

Ataser, Zafer
Artificial Immune Systems (AIS) are class of computational intelligent methods developed based on the principles and processes of the biological immune system. AIS methods are categorized mainly into four types according to the inspired principles and processes of immune system. These categories are clonal selection, negative selection, immune network and danger theory. The approach of negative selection algorithm (NSA) is one of the major AIS models. NSA is a supervised learning algorithm based on the imitation of the T cells maturation process in thymus. In this imitation, detectors are used to mimic the cells, and the process of T cells maturation is simulated to generate detectors. Then, NSA classifies the specified data either as normal (self) data or as anomalous (non-self) data. In this classification task, NSA methods can make two kinds of classification errors: a self data is classified as anomalous, and a non-self data is classified as normal data. In this thesis, a novel negative selection method, variable shaped detector (V-shaped detector), is proposed to increase the classification accuracy, or in other words decreasing classification errors. In V-shaped detector, new approaches are introduced to define self and represent detectors. V-shaped detector uses the combination of Local Outlier Factor (LOF) and kth nearest neighbor (k-NN) to determine a different radius for each self sample, thus it becomes possible to model the self space using self samples and their radii. Besides, the cubic b-spline is proposed to generate a variable shaped detector. In detector representation, the application of cubic spline is meaningful, when the edge points are used. Hence, Edge Detection (ED) algorithm is developed to find the edge points of the given self samples. V-shaped detector was tested using different data sets and compared with the well-known one-class classification method, SVM, and the similar popular negative selection method, NSA with variable-sized detector termed V-detector. The experiments show that the proposed method generates reasonable and comparable results.


Computational approaches leveraging integrated connections of multi-omic data toward clinical applications
Demirel, Habibe Cansu; Tunçbağ, Nurcan (2021-10-01)
In line with the advances in high-throughput technologies, multiple omic datasets have accumulated to study biological systems and diseases coherently. No single omics data type is capable of fully representing cellular activity. The complexity of the biological processes arises from the interactions between omic entities such as genes, proteins, and metabolites. Therefore, multi-omic data integration is crucial but challenging. The impact of the molecular alterations in multi-omic data is not local in the ...
Simple and complex behavior learning using behavior hidden Markov Model and CobART
Seyhan, Seyit Sabri; Alpaslan, Ferda Nur; Department of Computer Engineering (2013)
In this thesis, behavior learning and generation models are proposed for simple and complex behaviors of robots using unsupervised learning methods. Simple behaviors are modeled by simple-behavior learning model (SBLM) and complex behaviors are modeled by complex-behavior learning model (CBLM) which uses previously learned simple or complex behaviors. Both models have common phases named behavior categorization, behavior modeling, and behavior generation. Sensory data are categorized using correlation based...
Long-tailed graphical model and frequentist inference of the model parameters for biological networks
AĞRAZ, MELİH; Purutçuoğlu Gazi, Vilda (Informa UK Limited, 2020-03-12)
The biological organism is a complex structure regulated by interactions of genes and proteins. Various linear and nonlinear models can define activations of these interactions. In this study, we have aimed to improve the Gaussian graphical model (GGM), which is one of the well-known probabilistic and parametric models describing steady-state activations of biological systems, and its inference based on the graphical lasso, shortly Glasso, method. Because, GGM with Glasso can have low accuracy when the syst...
Stochastic simulation of large biochemical systems by approximate Gillespie algorithm
Purutçuoğlu Gazi, Vilda (IEEE; 2010-06-01)
In recent years the fast innovations for the development of new methods and algorithms in system biology enable the biologists to analyze and interpret the complex biochemical structures. One of the speedy development has been seen in mathematical methods for generating these complex systems on the computer. These techniques help the researcher to ask biologically interesting questions and test their expectations before starting their biological experiments. There are a number of methods which can approxima...
Mining microarray data for biologically important gene sets
Korkmaz, Gülberal Kırçiçeği Yoksul; Atalay, Mehmet Volkan; Department of Computer Engineering (2012)
Microarray technology enables researchers to measure the expression levels of thousands of genes simultaneously to understand relationships between genes, extract pathways, and in general understand a diverse amount of biological processes such as diseases and cell cycles. While microarrays provide the great opportunity of revealing information about biological processes, it is a challenging task to mine the huge amount of information contained in the microarray datasets. Generally, since an accurate model ...
Citation Formats
Z. Ataser, “ Variable shaped detector : a negative selection algorithm,” Ph.D. - Doctoral Program, Middle East Technical University, 2013.