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

Shu-Rui Liang

dblp:426/6505 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

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

Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
dimensionality reduction
1.012026
Crowdsourcing Feature Selection via a Distributed Evolutionary Algorithm · IEEE Trans. Serv. Comput. 2026
Data mining › dimensionality reduction › feature selection
distributed feature selection
1.012026
Crowdsourcing Feature Selection via a Distributed Evolutionary Algorithm · IEEE Trans. Serv. Comput. 2026
Data mining › dimensionality reduction
feature selection
1.012026
Crowdsourcing Feature Selection via a Distributed Evolutionary Algorithm · IEEE Trans. Serv. Comput. 2026

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

evolutionary algorithm · 2.0credibility-based aggregation · 2.0cooperative learning · 2.0
YearPublicationVenuePosition
2026 Crowdsourcing Feature Selection via a Distributed Evolutionary Algorithm
abstract
Crowdsourcing leverages the collective intelligence of the crowd to collect data and solve complex computational tasks. Driven by this paradigm, data can now be gathered more efficiently and at larger scales, thereby increasing the need for effective dimensionality reduction, which makes feature selection (FS) essential for efficient learning. In this paper, we refer to the problem in which multiple workers in a crowdsourcing environment collect data and concurrently optimize FS as the crowdsourcing feature selection (CFS) problem. In CFS, workers perform FS on local data and upload candidate feature subsets to complete the outsourced task. Nevertheless, the heterogeneity across multiple data sources hinders the formation of a reliable and high-quality consensus solution. To address this issue, we propose a cooperative learning-based Distributed Evolutionary Algorithm for the CFS problem (DEA-CFS). First, we formulate the CFS problem and define the roles of workers and the server, as well as their interactions in a crowdsourcing environment. Second, on the worker side, we design a distributed cooperative learning strategy that refines local solutions and mitigates data heterogeneity through confidence-aware fitness comparison. Third, on the server side, we introduce an adaptive credibility-based aggregation mechanism that aggregates a robust consensus solution. Extensive experiments on 18 datasets with up to 10,000 features demonstrate the efficiency and effectiveness of DEA-CFS. Specifically, compared to four existing distributed baselines, DEA-CFS achieves a superior average rank of 1.16 and obtains the best performance on 15 of the 18 datasets.
Shu-Rui Liang, Feng-Feng Wei, Qiuzhen Lin, Wenjian Luo, Weineng Chen
IEEE Trans. Serv. Comput.1
2025 Crowdsourcing Knowledge Integration Evolutionary Transfer Optimization for Feature Selection
abstract
Crowdsourcing has become a powerful tool for data collection and problem-solving, harnessing collective intelligence to address complex tasks. Building knowledge bases through such intelligence is gaining attention to enhance cross-domain model performance. As an essential technique for dimensionality reduction, the task of feature selection (FS) also emerges in the context of crowdsourcing, resulting in crowd-sourcing feature selection (CFS). Due to the diversity of workers and the varying quality of data in a crowdsourcing environment, CFS faces challenges such as heterogeneous data reliability and dynamic participation. To tackle these issues, we present Crowd-Fed Evolutionary Transfer Optimization (CFETO), an efficient and crowdsourcing-enhanced framework for feature selection. CFETO comprises a central server and multiple distributed workers: workers perform local data collection and optimization, extracting knowledge from their datasets, while the server integrates this knowledge to build a knowledge base. An evolutionary transfer learning strategy is further employed to harness this knowledge, thereby improving both convergence speed and selection robustness. Experiments on 20 real-world datasets show that CFETO outperforms traditional centralized FS methods approaches, underlining its potential for broader application in complex, distributed crowdsourcing scenarios.
Shu-Rui Liang, Feng-Feng Wei, Weineng Chen
SMC1