EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Dynamic Time‐Varying W‐Shaped and M‐Shaped Transfer Function Based Feature Selection Method for Large‐Scale Sparse Data

Zi-Rui Xu, Yu-Cai Wang, Wei-Zhong Sun, Jie-Sheng Wang, Shi Li, Si-Yu Jin, Yu-Wei Song, Yu-Liang Qi, Zhi-Guang Si

International Journal of Intelligent Systems · 2026-01 · 2026 (1)

DOI: 10.1155/int/2389650 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Intelligent Systems, online erschienen am 31.07.2026. Verfasst von Zi-Rui Xu und 8 weiteren Autor:innen. Die Arbeit nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Large‐scale sparse data are characterized by a massive feature dimensionality accompanied by significant sparsity in data elements. As a critical data preprocessing step, feature selection can effectively eliminate redundant and irrelevant information from the data, thereby substantially enhancing both the operational efficiency and predictive accuracy of models. To address the challenge of feature selection for large‐scale sparse data, a binary black‐winged kite optimization algorithm based on dynamic time‐varying W‐shaped and M‐shaped transfer functions is proposed. The W‐shaped and M‐shaped transfer functions are designed, and a time‐modulated factor is introduced to enable them to dynamically adjust along with the evolutionary process of the algorithm, thereby deriving the time‐varying transfer functions. Furthermore, on this basis, the Euclidean Metric Factor (EMF) is constructed according to the population distribution state in the continuous space, and the Feature Coding Difference Factor (FCDF) is developed based on the binary feature differences of the population in the discrete space. By integrating EMF and FCDF into the time‐varying transfer functions, the dynamic time‐varying transfer functions are ultimately established. This integrated function can better adapt to the search requirements across all stages of the algorithm, ensuring that the population consistently maintains a reasonable search rhythm and direction. Multiple sets of simulation experiments were designed to verify the effectiveness of the proposed method in solving feature selection tasks. Firstly, DTD‐W‐BKA and DTD‐M‐BKA were determined as the optimal variants across 12 large‐scale sparse datasets. Secondly, comparative experiments against other wrapper algorithms were conducted on real‐world cancer gene expression datasets, demonstrating that DTD‐W‐BKA possesses a significant advantage. Additionally, the performance stability of the proposed method was evaluated under different classifiers, and a systematic ablation study was utilized to validate the independent contributions and collaborative synergy of each respective module.

Zitieren

APA

Xu, Z., Wang, Y., Sun, W., Wang, J., Li, S., Jin, S., Song, Y., Qi, Y., & Si, Z. (2026). Dynamic Time‐Varying W‐Shaped and M‐Shaped Transfer Function Based Feature Selection Method for Large‐Scale Sparse Data. International Journal of Intelligent Systems, 2026(1). https://doi.org/10.1155/int/2389650

Vancouver

Xu Z, Wang Y, Sun W, Wang J, Li S, Jin S, et al. Dynamic Time‐Varying W‐Shaped and M‐Shaped Transfer Function Based Feature Selection Method for Large‐Scale Sparse Data. International Journal of Intelligent Systems. 2026;2026(1). doi:10.1155/int/2389650

BibTeX
@article{Xu2026,
  author = {Xu, Zi-Rui and Wang, Yu-Cai and Sun, Wei-Zhong and Wang, Jie-Sheng and Li, Shi and Jin, Si-Yu and Song, Yu-Wei and Qi, Yu-Liang and Si, Zhi-Guang},
  title = {Dynamic Time‐Varying W‐Shaped and M‐Shaped Transfer Function Based Feature Selection Method for Large‐Scale Sparse Data},
  journal = {International Journal of Intelligent Systems},
  year = {2026},
  volume = {2026},
  number = {1},
  doi = {10.1155/int/2389650}
}
Kostenlos starten →