Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization by Jian-Feng Cai (498405)

Binary contingency table. by Lu Xiao (314030)

Overview of the segmentation algorithm. by Michael C. Robitaille (11949174)

RMSE on the test data when fitting (logistic) quadratic models to binary data across increasing measurement error values . by Jakub Stoklosa (3315042)

Symmetry test result. by Jiyong Moon (16819302)

The Pseudo-Code of the IRBMO Algorithm. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization by Sandeep Jagonda Patil (22048337)

“…By integrating Latent Encoder Coupled Generative Adversarial Network (LEGAN) optimized with Binary Emperor Penguin optimizer (BEPO), the scheme enhances routing efficiency and security. …”

IRBMO vs. meta-heuristic algorithms boxplot. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

IRBMO vs. feature selection algorithm boxplot. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

<i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

“…From this dataset we can compute the MI between each interaction and the outcome and <b>(D)</b> obtain a ranked list (<i>I</i>_<i>δ</i>) based on this metric. <b>(E)</b> Starting from the interaction at the top of <i>I</i>_<i>δ</i>, <i>hi</i>PRS constructs <i>I</i>_<i>K</i>, selecting <i>K</i> (where <i>K</i> is user-specified) terms through the greedy optimization of the ratio between MI (<i>relevance</i>) and a suitable measure of similarity for interactions (<i>redundancy)</i> (cf. …”

QSAR model for predicting neuraminidase inhibitors of influenza A viruses (H1N1) based on adaptive grasshopper optimization algorithm by Z.Y. Algamal (5547620)

“…Obtaining a reliable QSAR model with few descriptors is an essential procedure in chemometrics. The binary grasshopper optimization algorithm (BGOA) is a new meta-heuristic optimization algorithm, which has been used successfully to perform feature selection. …”

Fig 1 - by Jakub Stoklosa (3315042)

Data_Sheet_1_Crystal Structure Prediction of Binary Alloys via Deep Potential.PDF by Haidi Wang (9694004)

Predicting Thermal Decomposition Temperature of Binary Imidazolium Ionic Liquid Mixtures from Molecular Structures by Hongpeng He (348094)

“…The subset of optimal descriptors was screened by combining the genetic algorithm with the multiple linear regression method. …”

Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data by Fei Xue (24567)

“…Specifically, the proposed method obtains the optimal DTR via integrating estimations of decision rules at multiple stages into a single multicategory classification algorithm without imposing additional constraints, which is also more computationally efficient and robust. …”

Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

Pseudo Code of RBMO. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

P-value on CEC-2017(Dim = 30). by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Memory storage behavior. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”

Elite search behavior. by Chenyi Zhu (9383370)

“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”