scholarly journals BicGO: a new biclustering algorithm based on global optimization

2018 ◽  
Author(s):  
Guojun Li ◽  
Zhengchang Su
Keyword(s):  
Global Optimization ◽  
Real Number ◽  
Large Scale ◽  
General Trend ◽  
Challenging Problem ◽  
Link Type ◽  
Scale Shift ◽  
Constant Shift

AbstractRecognizing complicated biclusters submerged in large scale datasets (matrix) has been being a highly challenging problem. We introduce a biclustering algorithm BicGO consisting of two separate strategies which can be selectively used by users. The BicGO which was developed based on global optimization can be implemented by iteratively answering if a real number belongs to a given interval. Tested on various simulated datasets in which most complicated and most general trend-preserved biclusters were submerged, BicGO almost always extracted all the actual bicluters with accuracy close to 100%, while on real datasets, it also achieved an incredible superiority over all the salient tools compared in this article. As far as we know, the BicGO is the first tool capable of identifying any complicated (e.g., constant, shift, scale, shift-scale, order-preserved, trend-preserved, etc), any shapes (narrow or broad) of biclusters with overlaps allowed. In addition, it is also highly parsimonious in the usage of computing resources. The BicGO is available at https://www.dropbox.com/s/hsj3j96rekoks5n/BicGO.zip?dl=0 for free download.

A large-scale shift of cropland structure profoundly affects grain production in the cold region of China

2021 ◽  
pp. 127300
Author(s):  
Tao Pan ◽  
Chi Zhang ◽  
Wenhui Kuang ◽  
Geping Luo ◽  
Guoming Du ◽  
...  
Keyword(s):  
Large Scale ◽  
Grain Production ◽  
Cold Region ◽  
Scale Shift

scholarly journals Image-based benchmarking and visualization for large-scale global optimization

2021 ◽  
Author(s):  
Kyle Robert Harrison ◽  
Azam Asilian Bidgoli ◽  
Shahryar Rahnamayan ◽  
Kalyanmoy Deb
Keyword(s):  
Global Optimization ◽  
Large Scale

scholarly journals Proteomic profiling dataset of chemical perturbations in multiple biological backgrounds

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Deborah O. Dele-Oni ◽  
Karen E. Christianson ◽  
Shawn B. Egri ◽  
Alvaro Sebastian Vaca Jacome ◽  
Katherine C. DeRuff ◽  
...  
Keyword(s):  
Large Scale ◽  
Cell Model ◽  
Cellular Responses ◽  
Proteomic Profiling ◽  
Reduced Representation ◽  
Link Type ◽  
Original Dataset ◽  
Quality Control Metrics ◽  
Biological Insight ◽  
Chromatin Profiling

AbstractWhile gene expression profiling has traditionally been the method of choice for large-scale perturbational profiling studies, proteomics has emerged as an effective tool in this context for directly monitoring cellular responses to perturbations. We previously reported a pilot library containing 3400 profiles of multiple perturbations across diverse cellular backgrounds in the reduced-representation phosphoproteome (P100) and chromatin space (Global Chromatin Profiling, GCP). Here, we expand our original dataset to include profiles from a new set of cardiotoxic compounds and from astrocytes, an additional neural cell model, totaling 5300 proteomic signatures. We describe filtering criteria and quality control metrics used to assess and validate the technical quality and reproducibility of our data. To demonstrate the power of the library, we present two case studies where data is queried using the concept of “connectivity” to obtain biological insight. All data presented in this study have been deposited to the ProteomeXchange Consortium with identifiers PXD017458 (P100) and PXD017459 (GCP) and can be queried at https://clue.io/proteomics.

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

Sign in / Sign up

Export Citation Format

Share Document