Demo Data from VLDB 2026 / reviewers in the wild / expert
Shukun Ma
dblp:321/3846
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2024
0000-0002-6861-7942ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Artificial intelligence and machine learning · 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.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 33% Transfer learning and domain adaptation · 33% Trustworthy machine learning · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
active learning |
0.8 | 1 | 2024 | Say No to Redundant Information: Unsupervised Redundant Feature Elimination for Active Learning · IEEE Trans. Multim. 2024 |
Machine learning › Transfer learning and domain adaptation
redundant feature elimination |
0.8 | 1 | 2024 | Say No to Redundant Information: Unsupervised Redundant Feature Elimination for Active Learning · IEEE Trans. Multim. 2024 |
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
sample selection |
0.8 | 1 | 2024 | Say No to Redundant Information: Unsupervised Redundant Feature Elimination for Active Learning · IEEE Trans. Multim. 2024 |
Methods — techniques the papers use, named apart from their topics
outlier elimination · 0.8feature clustering · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Say No to Redundant Information: Unsupervised Redundant Feature Elimination for Active LearningabstractThe usual active learning is to sample unlabeled set by designing efficient sample information evaluation algorithms. However, information redundancy between candidate sets is often overlooked. This can cause similar data to be labeled repeatedly, producing ineffective gains for the model. In this paper, we proposed an Unsupervised Redundant Feature Elimination Active Learning module (URFEAL), which utilizes the information feature coincidence of the unlabeled set to eliminate information redundant data, thus guaranteeing the validity of each candidate data. URFEAL consists of feature clusterer and eliminator. The feature clusterer computes class boundaries based on feature densities to discretize each class of the candidate set, and the eliminator judges data similarity by overlapping degree to eliminate redundant data features. Furthermore, we propose an anti-noise sampling strategy Outlier Feature Elimination (OFE) in URFEAL to filter mislabeled sets for relabeling in the data sampling stage. We extensively evaluate our method by image classification and perform experimental validation on CIFAR-10, CIFAR-100 and CALTECH-101. The experimental results show that the improvements we make are especially significant for most existing active learning algorithms in the low data stage, which demonstrates the effectiveness and generality of URFEAL. Shukun Ma, Zhuo Zhang 0025, Yang Li 0111, Shuai Xiao 0001, Jiabao Wen, Wen Lu 0005, Xinbo Gao 0001 |
IEEE Trans. Multim. | 2 |
| 2023 | Efficient data-driven behavior identification based on vision transformers for human activity understanding
Zhuo Zhang 0025, Shuai Xiao 0001, Shukun Ma, Yang Li 0111, Wen Lu 0005, Xinbo Gao 0001 |
Neurocomputing | 4 |
| 2023 | Few-shot ship classification based on metric learning
Changlin Chen, Shukun Ma |
Multim. Syst. | 3 |