Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/476402
Title: Hybridisation of Greedy Randomized Adaptive Search Procedure with Tabu Search for gene selection on microarray data
Authors: Zohreh Golbagtaklimi (P53659)
Supervisor: Salwani Abdullah, Prof. Dr.
Keywords: DNA microarrays
Issue Date: 25-Jun-2012
Description: Due to the wide availability of vast amount of data and vital need for turning these data into valuable information and knowledge, data mining techniques has attracted a great attention in recent years. Feature selection is considered as one of these techniques which choose a subset of input variables from large amount of data by eliminating features with little or no predictive information. According to the complexity and high dimension of real life data, feature selection is a time consuming process and assumed as a NP-hard problem. Microarray data is an example of such a data with high dimension. Biologists not just interested on accurate classification tools, but they also need to identify biomarkers of diseases, which are achieved by reduction of dimensionality, so that the relationship between the symptoms and their corresponding diagnosis can be inferred. Selection of useful genes reduces the large number of irrelevant and redundant genes while increasing the classification accuracy and decreasing the computational time. In this thesis, a hybrid Greedy Randomized Adaptive Search Procedure (GRASP) and Tabu Search (TS) has been applied to gene selection on microarray data with an aim to minimise the subset gene cardinality and maximise the classification accuracy. GRASP is a multi-start constructive method which constructs a solution in the first phase and improve that solution by applying a local search in second phase. However, using the seminal techniques in both phases of GRASP makes it prohibitive to use in high-dimensional datasets. A hybrid GRASP that uses a Tabu search (i.e. a metaheuristic with an adaptive memory) in the second phase allows the exploration around the constructed solution while looking for an improvement. It guides a local search procedure to explore the search space beyond local optimality. In this research, in order to evaluate the selected gene subset, the Naive Bayes classifier is chosen. The proposed approach is tested on five standard microarray datasets. The experimental results illustrate that the proposed method is able to obtain competitive results compared to other previous methods in the literature in terms of minimal cardinality and maximum accuracy.,Master / Sarjana
Pages: 149
Call Number: Q335.7.G585 2012 3
Publisher: UKM, Bangi
Appears in Collections:Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Files in This Item:
File Description SizeFormat 
ukmvital_85031+SOURCE1+SOURCE1.0.PDF
  Restricted Access
3.95 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.