Evidence map›Paper›PMID 42187379›Full record

ArticleBiomimetics (Basel, Switzerland)2026

Federated Multi-View Unsupervised Feature Selection via Bio-Inspired Hierarchical-Cognitive Tianji's Horse Racing Optimization and Tensor Learning.

Rong Cheng, Zhiwei Sun, Kun Qi, Wangyu Wu, Lingling Xu

Abstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Rong ChengSchool of Electronic and Communication Engineering, Shenzhen Polytechnic University, Shenzhen 518055, China.
Zhiwei SunUndergraduate School of Artificial Intelligence, Shenzhen Polytechnic University, Shenzhen 518055, China.ORCID 0009-0008-7846-4792
Kun QiSchool of Electronic and Communication Engineering, Shenzhen Polytechnic University, Shenzhen 518055, China.ORCID 0009-0007-3614-2835
Wangyu WuSchool of Computer Science, University of Liverpool, Liverpool L69 3DR, UK.ORCID 0009-0005-8404-9489
Lingling XuSchool of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

As multi-view datasets expand across diverse practical fields, feature selection (FS) has become an indispensable preparatory stage for machine learning models. Nevertheless, real-world multi-view data is often unlabeled and distributed among isolated clients, posing significant challenges to traditional centralized methods due to privacy concerns and communication constraints. Furthermore, existing centralized and federated approaches frequently suffer from entrapment in local optima and lack robust convergence guarantees. To address these issues, we propose Fed-MUFSHT, a federated framework for multi-view unsupervised FS (MUFS) that integrates tensor learning with a novel metaheuristic optimizer, Hierarchical-Cognitive Tianji's Horse Racing Optimization (HC-THRO). Within the federated learning paradigm, Fed-MUFSHT follows a dual-stage local optimization process. Stage 1 applies HC-THRO, which integrates Hierarchical Competitive Learning and Adaptive Cognitive Mapping to simulate multi-level strategic competition and cognitive adaptation among individuals. This design enhances global exploration, adaptive learning, and fine-grained feature selection in high-dimensional spaces. Stage 2 employs a TL module based on canonical polyadic (CP) decomposition to perform missing-view imputation and refine latent representation learning. At the global level, a privacy-preserving aggregation strategy based on Normalized Mutual Information (NMI) and feature weights enables efficient model coordination without exposing raw data. Comparative experiments on several public benchmark datasets reveal that Fed-MUFSHT maintains clear advantages over strong competing methods, showing better optimization results together with more dependable convergence characteristics. The overall evidence suggests that the proposed approach is both robust and effective for distributed optimization tasks involving privacy protection.

Indexed as

bio-inspired computationfederated learningmulti-view unsupervised feature selectionprivacy preservationtensor learningTianji’s horse racing optimization

Identifiers

PMID42187379
PMCPMC13204331

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.