Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/7170
Title: Gene selection using multiple queen colonies in large scale machine learning [articol]
Authors: Sampath Kumar, A.
Vivekanandan, P.
Subjects: Big Data
Bioinformatics
Microarray
Gene Selection
Feature Selection
Correlation based Feature Selection (CFS)
Genetic Algorithm (GA)
Honey Bee Mating Optimization (HBMO)
Issue Date: 2018
Publisher: Timișoara : Editura Politehnica
Citation: Sampath Kumar.A.: Vivekanandan,P.: Gene selection using multiple queen colonies in large scale machine learning. Timişoara: Editura Politehnica, 2018.
Series/Report no.: Journal of Electrical Engineering;Vol 18 No 4
Abstract: In the field of bioinformatics research, there has been a tremendous increase in the volume of data. This is due to the fact that all the processes are digitized and there is an availability of high throughput devices at a lower cost owing to which data volume is rising everywhere. As an example, the approximate size of a single sequenced human genome is 200 gigabytes. With the growth of big data technologies, this trend in the increasing volumes of data is bolstered by reduced computing expenses and enhanced analytics throughput. Technologies such as automated genome sequencers that capture big data are becoming lesser expensive with increased efficacy giving rise to this new era of big data in the field of bioinformatics. There has been a supply of large volume of data in many fields due to the development of microarray technology. This has been especially useful in predicting as well as in the diagnosis of cancer. Since the extracted genes from microarray are rife with noise, the task is selecting genes that are related to cancer, so that the disease can be classified precisely. For the efficient feature selection in the Hadoop framework, a new feature selection algorithm has been suggested- Correlation based Feature Selection (CFS), Genetic Algorithm (GA) and Honey Bee Mating Optimization (HBMO) algorithm. These techniques help in decreasing the problem dimension and noise and improvising the algorithm speed by the removal of irrelevant or superfluous features. It has been shown by experimental outcomes that the suggested technique helps to achieve better performance when compared to the other techniques.
URI: https://dspace.upt.ro/xmlui/handle/123456789/7170
ISSN: 1582-4594
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Sampath Kumar_f.pdf632.43 kBAdobe PDFView/Open


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