Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haojiong Shangguan

dblp:368/7403 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0009-0007-3911-3191ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › dimensionality reduction
feature selection
0.812024
MEL: Efficient Multi-Task Evolutionary Learning for High-Dimensional Feature Selection · IEEE Trans. Knowl. Data Eng. 2024
Data mining › dimensionality reduction › feature selection
high-dimensional feature selection
0.812024
MEL: Efficient Multi-Task Evolutionary Learning for High-Dimensional Feature Selection · IEEE Trans. Knowl. Data Eng. 2024

Methods — techniques the papers use, named apart from their topics

particle swarm optimization · 0.8multi-task learning · 0.8evolutionary computation · 0.8
YearPublicationVenuePosition
2024 MEL: Efficient Multi-Task Evolutionary Learning for High-Dimensional Feature Selection
abstract
Feature selection is a crucial step in data mining to enhance model performance by reducing data dimensionality. However, the increasing dimensionality of collected data exacerbates the challenge known as the “curse of dimensionality”, where computation grows exponentially with the number of dimensions. To tackle this issue, evolutionary computational (EC) approaches have gained popularity due to their simplicity and applicability. Unfortunately, the diverse designs of EC methods result in varying abilities to handle different data, often underutilizing and not sharing information effectively. In this article, we propose a novel approach called PSO-based Multi-task Evolutionary Learning (MEL) that leverages multi-task learning to address these challenges. By incorporating information sharing between different feature selection tasks, MEL achieves enhanced learning ability and efficiency. We evaluate the effectiveness of MEL through extensive experiments on 22 high-dimensional datasets. Comparing against 24 EC approaches, our method exhibits strong competitiveness. In addition, we have open-sourced our code on GitHub.
Xubin Wang 0001, Haojiong Shangguan, Shangrui Wu, Weijia Jia 0001
IEEE Trans. Knowl. Data Eng.2