Rore: robust and efficient antioxidant protein classification via a novel dimensionality reduction strategy based on learning of fewer features

In protein identification, researchers increasingly aim to achieve efficient classification using fewer features. While many feature selection methods effectively reduce the number of model features, they often cause information loss caused by merely selecting or discarding features, which limits classifier performance. To address this issue, we present Rore, an algorithm based on a feature-dimensionality reduction strategy. By mapping the original features to a latent space, Rore retains all relevant feature information while using fewer representations of the latent features. This approach significantly preserves the original information and overcomes the information loss problem associated with previous feature selection. Through extensive experimental validation and analysis, Rore demonstrated excellent performance on an antioxidant protein dataset, achieving an accuracy of 95.88% and MCC of 91.78%, using vectors including only 15 features. The Rore algorithm is available online at http://112.124.26.17:8021/Rore .

Authors

Institutions

Publication Details

Journal
Genomics & Informatics
Published
2024-12-04
DOI
https://doi.org/10.1186/s44342-024-00026-z
Primary Topic
Machine Learning in Bioinformatics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rore: robust and efficient antioxidant protein classification via a novel dimensionality reduction strategy based on learning of fewer features

Chaolu Meng, Quan Zou, Lei Shi, Xi Su et al.
Genomics & Informatics
Machine Learning in Bioinformatics
article

Rore: robust and efficient antioxidant protein classification via a novel dimensionality reduction strategy based on learning of fewer features

Chaolu Meng, Quan Zou, Lei Shi, Xi Su, Ying Ju, Yongqi Hou
article en

Abstract

In protein identification, researchers increasingly aim to achieve efficient classification using fewer features. While many feature selection methods effectively reduce the number of model features, they often cause information loss caused by merely selecting or discarding features, which limits classifier performance. To address this issue, we present Rore, an algorithm based on a feature-dimensionality reduction strategy. By mapping the original features to a latent space, Rore retains all relevant feature information while using fewer representations of the latent features. This approach significantly preserves the original information and overcomes the information loss problem associated with previous feature selection. Through extensive experimental validation and analysis, Rore demonstrated excellent performance on an antioxidant protein dataset, achieving an accuracy of 95.88% and MCC of 91.78%, using vectors including only 15 features. The Rore algorithm is available online at http://112.124.26.17:8021/Rore .

Genomics & InformaticsVol. 22(1)
Inner Mongolia Agricultural University (CN), University of Electronic Science and Technology of China (CN), Xiamen University (CN), Inner Mongolia University (CN), Foshan Maternity and Child Health Care Hospital (CN), Shanghai Changzheng Hospital (CN), Inner Mongolia Academy of Agricultural & Animal Husbandry Sciences (CN)
National Natural Science Foundation of China, Natural Science Foundation of Inner Mongolia
Openalex Percentile: Top 80%
Machine Learning in Bioinformatics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.