Stellar-Mass Black Hole Optimization for Biclustering Microarray Gene Expression Data

  title={Stellar-Mass Black Hole Optimization for Biclustering Microarray Gene Expression Data},
  author={Balamurugan Rengeswaran and A. M. Natarajan and Kandhasamy Premalatha},
  journal={Applied Artificial Intelligence},
  pages={353 - 381}
DNA microarray gene expression data analysis has provided new insights into gene function, disease pathophysiology, disease classification, and drug development. Biclustering in gene expression data is a subset of the genes demonstrating consistent patterns over a subset of the conditions. The proposed work finds the significant biclusters in large expression data using a novel optimization technique called stellar-mass black hole optimization (SBO). This optimization algorithm is inspired from… 
A modified harmony search method for biclustering microarray gene expression data
The experimental results show that the MHS outperforms HS in optimisation functions and biclustering problems, and the biological relevance of the biclusters with Gene Ontology in terms of function, process and component is determined.
Gene Expression Analysis Using Clustering Methods: Comparison Analysis
A biclustering calculation to distinguish subgroups of information which shows corresponded conduct under explicit test conditions is executed and it presumes that the proposed work performs better when contrasted with other existing bunching calculations, for example, FCM, FPCM and EMFPCM.
Query expansion for patent retrieval using a modified stellar-mass black hole optimization
Preliminary results have shown that the proposed modified stellar mass black hole (MSBO) method effectively clusters identical expressions and consequently the detected biclustering algorithms were effective in generating suitable words for expanding a given query.
Hybrid energy system design using greedy particle swarm and biogeography‐based optimisation
Improvements in coverage of two sets, hypervolume and diversity performance indices are used to compare results of the proposed method to non-dominated sorting genetic algorithm and the multi-objective PSO, and show an improved performance of the suggested method in finding the optimal system design.
A Comprehensive Survey on Portfolio Optimization, Stock Price and Trend Prediction Using Particle Swarm Optimization
This article analyzes the superiority of PSO for stock portfolio optimization, stock price and trend prediction, and other related stock market aspects along with implications of PSN, and aims at balancing the economics and computational intelligence aspects.
Improved Binary Sailfish Optimizer Based on Adaptive β-Hill Climbing for Feature Selection
This work introduces a binary variant of the recently-proposed Sailfish Optimizer (SFO), named as Binary Sailfish (BSF) optimizer, to solve FS problems and demonstrates the superiority of both BSF and <inline-formula> <tex-math notation="LaTeX">$\text{A}\beta $ </tex- math></inline- formula>BSF algorithms in solving FS problems.
A Reward Population-Based Differential Genetic Harmony Search Algorithm
The result suggests that the reward population-based differential genetic harmony search algorithm has the merits of a strong global search ability, high solving accuracy, and satisfactory stability.
Nature-Inspired Algorithms Analysis on various Benchmark Functions using Python and Golang
This research work will identify which freely available platform among Python and Golang is better for reliable performance and tremendous productivity of Nature-Inspired algorithms.
Evolutionary Computation, Optimization and Learning Algorithms for Data Science
This chapter focuses on data science as a crucial area, specifically focusing on a curse of dimensionality (CoD) which is due to the large amount of generated/sensed/collected data, especially large sets of extracted features for a particular purpose.
Black hole optimizer for the optimal power injection in distribution networks using DG
The optimal sizing of Distributed Generators (DG) in electric power distribution networks is carried out through a metaheuristic optimization strategy. To size DG it is proposed an optimal power flow


Parallelized Evolutionary Learning for Detection of Biclusters in Gene Expression Data
This paper proposes a new biclustering algorithm based on evolutionary learning that demonstrates a significant improvement in discovering additive biclusters and is able to discover bicluster seeds within a limited computing time.
Evolutionary Algorithm Based on New Crossover for the Biclustering of Gene Expression Data
A new evolutionary algorithm based on a new crossover method, dedicated to the biclustering of gene expression data is proposed, that extracts high quality biclusters with highly correlated genes that are particularly involved in specific ontology structure.
Biclustering of microarray data with MOSPO based on crowding distance
This work presents the CMOPSOB (Crowding distance based Multi-objective Particle Swarm Optimization Biclustering), a novel clustering approach for microarray datasets to cluster genes and conditions highly related in sub-portions of the microarray data.
Biclustering of expression data with evolutionary computation
The approach, named SEBI, is based on evolutionary algorithms, which have been proven to have excellent performance on complex problems, and searches for biclusters following a sequential covering strategy, and shows an excellent performance at finding patterns in gene expression data.
A memetic algorithm for discovering negative correlation biclusters of DNA microarray data
Discovering statistically significant biclusters in gene expression data
A new method to detect significant biclusters in large expression datasets is proposed and is able to detect and relate finer tissue types than was previously possible in cancer data and outperforms the biclustering algorithm of Cheng and Church (2000).
An EA framework for biclustering of gene expression data
This paper proposes a general framework that embed such biclustering methods as local search procedures in an evolutionary algorithm and demonstrates on one prominent example that this approach achieves significant improvements in the quality of the biclusters when compared to the application of the greedy strategy alone.
On biclustering of gene expression data
  • Mahmoud Mounir, M. Hamdy
  • Computer Science
    2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)
  • 2015
This survey introduced some definitions of the biclustering, a non-supervised technique that outperforms the traditional clustering techniques because it can group both genes and conditions in the same time.