Jun-Ying Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jun-Ying Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bin-Bin Jia
College of Electrical and Information Engineering, LanZhou University of Technology, LanZhou, China
5 shared publications - Min-Ling Zhang
Southeast University, Nanjing, China
3 shared publications - Jian-Ping Sun
College of Electrical and Information Engineering, Lanzhou University of Technology, Lanzhou 730050, China
2 shared publications - Ya-Hong Zhao
Department of Applied Mathematics, Lanzhou University of Technology, Lanzhou 730050, China
2 shared publications Bin-Bin Jia
College of Electrical and Information Engineering, LanZhou University of Technology, LanZhou, China
1 shared publicationMin-Ling Zhang
School of Computer Science and Engineering, Southeast University, Nanjing, China
1 shared publication
Latest Publications
- Open Access
- 16 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4210
Augmenting Graph-Based Partial Label Learning with Predictive Representations
Partial label learning (PLL) addresses the problem of learning from training examples with candidate label sets, where only one label is ground-truth. The key challenge lies in disambiguating the candidate labels while learning an accurate classifier. Graph-based PLL methods have emerged as a mainstream paradigm, which leverage the manifold structure of the feature space to propagate disambiguation information across neighboring instances. However, these methods construct the disambiguation graph exclusively from the original feature space, which may be corrupted by noise, outliers, and class-irrelevant variations. In this paper, we propose a novel framework termed Predictive Representation Augmentation (PRA) to address this limitation. The key idea is to first train a base graph-based PLL method on the original data, then use the predictive representations produced by the trained model as enhanced label-space information to guide graph construction, and augment the prediction model input with the concatenation of original features and predictive representations for retraining. In this way, the disambiguation graph benefits from structural information derived from both the feature space and the enhanced label space. We instantiate our framework on three representative graph-based PLL methods, namely PL-LEAF, PL-AGGD, and PL-CL. The experimental results on six real-world datasets demonstrate that PRA consistently improves the classification performance of all three base methods and, after Holm–Bonferroni correction, achieves statistically significant improvements in 17 out of 18 pairwise comparisons.
- 16 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4210
Open AccessAugmenting Graph-Based Partial Label Learning with Predictive Representations
Partial label learning (PLL) addresses the problem of learning from training examples with candidate label sets, where only one label is ground-truth. The key challenge lies in disambiguating the candidate labels while learning an accurate classifier. Graph-based PLL methods have emerged as a mainstream paradigm, which leverage the manifold structure of the feature space to propagate disambiguation information across neighboring instances. However, these methods construct the disambiguation graph exclusively from the original feature space, which may be corrupted by noise, outliers, and class-irrelevant variations. In this paper, we propose a novel framework termed Predictive Representation Augmentation (PRA) to address this limitation. The key idea is to first train a base graph-based PLL method on the original data, then use the predictive representations produced by the trained model as enhanced label-space information to guide graph construction, and augment the prediction model input with the concatenation of original features and predictive representations for retraining. In this way, the disambiguation graph benefits from structural information derived from both the feature space and the enhanced label space. We instantiate our framework on three representative graph-based PLL methods, namely PL-LEAF, PL-AGGD, and PL-CL. The experimental results on six real-world datasets demonstrate that PRA consistently improves the classification performance of all three base methods and, after Holm–Bonferroni correction, achieves statistically significant improvements in 17 out of 18 pairwise comparisons.
- 16 July 2025
- Published by Elsevier in Pattern Recognition
- Vol. 171
Partial label learning with semi-supervised clustering disambiguation
- 16 July 2025
- Published by Elsevier in Pattern Recognition
- Vol. 171
Partial label learning with semi-supervised clustering disambiguation
- 3 May 2025
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 19 (12) , 1-3
Pairwise statistical comparisons of multiple algorithms
- 3 May 2025
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 19 (12) , 1-3
Pairwise statistical comparisons of multiple algorithms
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 11298-11312
Instance-Specific Loss-Weighted Decoding for Decomposition-Based Multiclass Classification
Multiclass classification problems are often addressed by decomposing them into a set of binary classification tasks. A critical step in this approach is the effective aggregation of predictions from each decomposed binary classifier to yield the final multiclass prediction, a process known as decoding. Existing studies have ignored the varying generalization ability of each binary classifier across different samples during decoding, potentially leading to suboptimal performance. In this article, we propose an instance-specific loss-weighted (ILW) decoding strategy that gauges the generalization ability of each binary classifier for one specific sample based on its neighboring samples. This estimated generalization ability is then used to adjust the importance of the binary classifier in determining the sample’s final prediction. Experimental results validate the effectiveness of the ILW decoding strategy. Furthermore, we demonstrate that softmax regression can be reinterpreted as a one-versus-rest (OvR) decomposition-based multiclass classification algorithm, enabling the application of our decoding strategy to enhance its performance. Comparative studies clearly demonstrate the superiority of the improved softmax regression over its traditional counterpart.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 11298-11312
Instance-Specific Loss-Weighted Decoding for Decomposition-Based Multiclass Classification
Multiclass classification problems are often addressed by decomposing them into a set of binary classification tasks. A critical step in this approach is the effective aggregation of predictions from each decomposed binary classifier to yield the final multiclass prediction, a process known as decoding. Existing studies have ignored the varying generalization ability of each binary classifier across different samples during decoding, potentially leading to suboptimal performance. In this article, we propose an instance-specific loss-weighted (ILW) decoding strategy that gauges the generalization ability of each binary classifier for one specific sample based on its neighboring samples. This estimated generalization ability is then used to adjust the importance of the binary classifier in determining the sample’s final prediction. Experimental results validate the effectiveness of the ILW decoding strategy. Furthermore, we demonstrate that softmax regression can be reinterpreted as a one-versus-rest (OvR) decomposition-based multiclass classification algorithm, enabling the application of our decoding strategy to enhance its performance. Comparative studies clearly demonstrate the superiority of the improved softmax regression over its traditional counterpart.
- 18 March 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (9) , 3671-3700
Towards exploiting linear regression for multi-class/multi-label classification: an empirical analysis
- 18 March 2024
- Published by Springer Nature in International Journal of Machine Learning and Cybernetics
- Vol. 15 (9) , 3671-3700
Towards exploiting linear regression for multi-class/multi-label classification: an empirical analysis
- Open Access
- 28 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 197499-197507
Combining One-vs-One Decomposition and Instance-Based Learning for Multi-Class Classification
Multi-class classification is one of the most important supervised learning problems and can be solved by either designing direct multi-class classifiers (direct strategy) or decomposing it into a set of binary classification problems (indirect strategy). Direct strategy only needs training one unified classifier while indirect strategy, especially the one-vs-one decomposition method, has shown its superiority and been utilized by some popular software packages. In this article, a first attempt towards bridging the gap between direct strategy and one-vs-one decomposition for multi-class classification is conducted, and accordingly a novel approach named CODIL is proposed. Specifically, CODIL firstly transforms the class vector into a ternary label matrix (only with $\{-1,0,+1\}$ ) via one-vs-one rule, where each column of the label matrix corresponds to a pair of classes. Then, CODIL determines the binary label vector (only with $\{-1,+1\}$ ) for unseen instance by exploiting the manifold structure information residing in its $k$ nearest neighbors, where each element of the label vector denotes the unseen instance’s prediction for its corresponding class pair. Finally, the class for unseen instance is returned via majority voting based on the binary label vector. Extensive comparative studies are conducted between CODIL and six well-established multi-class approaches over seventeen benchmark multi-class data sets. The experimental results show the superiority of the proposed CODIL approach against the compared approaches.
- 28 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 197499-197507
Open AccessCombining One-vs-One Decomposition and Instance-Based Learning for Multi-Class Classification
Multi-class classification is one of the most important supervised learning problems and can be solved by either designing direct multi-class classifiers (direct strategy) or decomposing it into a set of binary classification problems (indirect strategy). Direct strategy only needs training one unified classifier while indirect strategy, especially the one-vs-one decomposition method, has shown its superiority and been utilized by some popular software packages. In this article, a first attempt towards bridging the gap between direct strategy and one-vs-one decomposition for multi-class classification is conducted, and accordingly a novel approach named CODIL is proposed. Specifically, CODIL firstly transforms the class vector into a ternary label matrix (only with $\{-1,0,+1\}$ ) via one-vs-one rule, where each column of the label matrix corresponds to a pair of classes. Then, CODIL determines the binary label vector (only with $\{-1,+1\}$ ) for unseen instance by exploiting the manifold structure information residing in its $k$ nearest neighbors, where each element of the label vector denotes the unseen instance’s prediction for its corresponding class pair. Finally, the class for unseen instance is returned via majority voting based on the binary label vector. Extensive comparative studies are conducted between CODIL and six well-established multi-class approaches over seventeen benchmark multi-class data sets. The experimental results show the superiority of the proposed CODIL approach against the compared approaches.