Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/7143
Title: Bi-clustering algorithm for microarray gene data based on the combination of FCM and Lion optimization algorithm [articol]
Authors: Dhas, P. Edwin
Gomathi, B. Sankara
Subjects: Microarray gene data
Clustering
Gene analysis
Issue Date: 2019
Publisher: Timișoara : Editura Politehnica
Citation: Dhas,P. Edwin; Gomathi,B. Sankara. Bi-clustering algorithm for microarray gene data based on the combination of FCM and Lion optimization algorithm. Timişoara: Editura Politehnica, 2019.
Series/Report no.: Journal of Electrical Engineering;Vol 19 No 1
Abstract: The exploitation of microarray gene data is increasing over time, owing to the technological advancement of biomedical science. The gene data reveals many important details and is necessary to analyse the data with intense care. The gene data analysis is one of the significant research areas and this work proposes an unsupervised way of gene analysis. The gene analysis can be carried out by supervised, semi-supervised or unsupervised techniques. Both the supervised and semi-supervised analysis requires the process of system training and it requires prior knowledge about the dataset. On the contrary, the unsupervised technique involves no training and the related gene data are grouped together without any prior arrangements. Hence, this work proposes an unsupervised bi-clustering algorithm for microarray gene data by combining the Fuzzy C Means (FCM) and Lion Optimization Algorithm (LOA). The performance of the proposed work is tested in terms of precision, recall, F-measure, rand index and time consumption. The experimental results prove the efficacy of the proposed clustering algorithm.
URI: https://dspace.upt.ro/xmlui/handle/123456789/7143
ISSN: 1582-4594
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Dhas_f.pdf298.48 kBAdobe PDFView/Open


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