Shunxiang Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shunxiang Wu has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
Wei Weng
Department of Automation, Xiamen University, Xiamen, People’s Republic of China
4 shared publicationsM.Q. Li
Center for Systems and Control, Xiamen University, Xiamen, Fujian 361005, China
2 shared publications- Sifeng Liu
College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China
2 shared publications Yun Kang
Department of Automation, Xiamen University, Xiamen, Fujian, PR China
2 shared publicationsYuwen Li
Department of Automation, Xiamen University, Xiamen, China
2 shared publicationsBai-Hua Chen
Department of Automation, Xiamen University, Xiamen, People’s Republic of China
1 shared publication
Latest Publications
- 26 October 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (7) , 8302-8320
Exploring instance correlations with local discriminant model for multi-label feature selection
- 26 October 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (7) , 8302-8320
Exploring instance correlations with local discriminant model for multi-label feature selection
- 12 August 2020
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (1) , 308-325
An efficient stacking model with label selection for multi-label classification
- 12 August 2020
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (1) , 308-325
An efficient stacking model with label selection for multi-label classification
- Open Access
- 26 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 127427-127437
An Efficient Stacking Model of Multi-Label Classification Based on Pareto Optimum
Nowadays, multi-label data are ubiquitous in real-world applications, in which each instance is associated with a set of labels. Multi-label learning has attracted significant attentions from researchers and plenty of algorithms have been proposed. Among those algorithms binary relevance (BR) is a widely used framework for multi-label classification. It constructs binary classifiers for each label by means of one-vs-rest style. BR approach is a simple and straight forward way of problem transformation for multilabel learning, but it ignores label correlations totally. Stacking based BR is a feasible way to tackle this problem. The key issue of stacking based BR is how to select label subset to extend the original features for each label. Existing methods of stacking based BR usually select identical label subset for all labels. It may be suboptimal as each label has its own most related label subset. In this paper, a novel stacking based method is introduced to utilize label correlations based on Pareto Optimum for improving the performance of BR. Our method builds a stack of two layers of BR classifiers. At the first layer, a group of binary classifiers are constructed, one for a label. At the second layer, for each label we employ Pareto Optimum to select most related label subset, then augments the original features by the selected label subset. The final binary classifiers for each label are constructed based on their corresponding reconstructed feature space. Comparing to other well-established stacking multi-label learning algorithms in terms of different multi-label classification criteria, experimental results on several multi-label benchmark datasets testify the superiority of the proposed methods.
- 26 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 127427-127437
Open AccessAn Efficient Stacking Model of Multi-Label Classification Based on Pareto Optimum
Nowadays, multi-label data are ubiquitous in real-world applications, in which each instance is associated with a set of labels. Multi-label learning has attracted significant attentions from researchers and plenty of algorithms have been proposed. Among those algorithms binary relevance (BR) is a widely used framework for multi-label classification. It constructs binary classifiers for each label by means of one-vs-rest style. BR approach is a simple and straight forward way of problem transformation for multilabel learning, but it ignores label correlations totally. Stacking based BR is a feasible way to tackle this problem. The key issue of stacking based BR is how to select label subset to extend the original features for each label. Existing methods of stacking based BR usually select identical label subset for all labels. It may be suboptimal as each label has its own most related label subset. In this paper, a novel stacking based method is introduced to utilize label correlations based on Pareto Optimum for improving the performance of BR. Our method builds a stack of two layers of BR classifiers. At the first layer, a group of binary classifiers are constructed, one for a label. At the second layer, for each label we employ Pareto Optimum to select most related label subset, then augments the original features by the selected label subset. The final binary classifiers for each label are constructed based on their corresponding reconstructed feature space. Comparing to other well-established stacking multi-label learning algorithms in terms of different multi-label classification criteria, experimental results on several multi-label benchmark datasets testify the superiority of the proposed methods.
- Open Access
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36810-36818
IFFLC: An Integrated Framework of Feature Learning and Classification for Multiple Diagnosis Codes Assignment
The International Classification of Diseases, Version 9 (ICD-9) is often used to identify patients with specific diagnoses. However, certain conditions may not be accurate reflected by the ICD-9 codes, and diagnoses code assignments are complex time-consuming processes. Although there are existing methods for automotive disease diagnostic assignment techniques, they have limitations on the descriptiveness and interpretability of diseases based on features. More importantly, they ignored the importance of different features with respect to different diseases. To address the above-mentioned challenges, we propose a novel framework, namely IFFLC, which can select the most relevant features, learn disease-specific features for each disease, and perform multiple diagnosis codes' assignment. Specifically, we first develop feature selection based on disease information entropy to remove redundant and irrelevant features in both medical chart data and medical laboratory data. Then, we build a novel multiple diagnosis codes' classifier by learning the disease-specific features and exploring the intra-correlations between diseases. We employ an alternating direction method of multipliers to iteratively solve the related optimization problem. The extensive experiments on a real-world ICU database verify the superiority of the proposed method over state-of-the-art approaches.
- 1 March 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 36810-36818
Open AccessIFFLC: An Integrated Framework of Feature Learning and Classification for Multiple Diagnosis Codes Assignment
The International Classification of Diseases, Version 9 (ICD-9) is often used to identify patients with specific diagnoses. However, certain conditions may not be accurate reflected by the ICD-9 codes, and diagnoses code assignments are complex time-consuming processes. Although there are existing methods for automotive disease diagnostic assignment techniques, they have limitations on the descriptiveness and interpretability of diseases based on features. More importantly, they ignored the importance of different features with respect to different diseases. To address the above-mentioned challenges, we propose a novel framework, namely IFFLC, which can select the most relevant features, learn disease-specific features for each disease, and perform multiple diagnosis codes' assignment. Specifically, we first develop feature selection based on disease information entropy to remove redundant and irrelevant features in both medical chart data and medical laboratory data. Then, we build a novel multiple diagnosis codes' classifier by learning the disease-specific features and exploring the intra-correlations between diseases. We employ an alternating direction method of multipliers to iteratively solve the related optimization problem. The extensive experiments on a real-world ICU database verify the superiority of the proposed method over state-of-the-art approaches.
- 11 January 2018
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 49 (4) , 783-799
New hesitation-based distance and similarity measures on intuitionistic fuzzy sets and their applications
In this paper, we present new definitions on distance and similarity measures between intuitionistic fuzzy sets (IFSs) by combining with hesitation degree. First, we discuss the limitations in traditional distance and similarity measures, which are caused by the neglect of hesitation degree's influence. Even though a vector-valued similarity measure was proposed, which has two components indicating similarity and hesitation aspects, it still cannot perform well in practical applications because hesitation works only when the values of similarity measures are equal. In order to overcome the limitations, we propose new definitions on hesitation, distance and similarity measures, and research some theorems which satisfy the requirements of the proposed definitions. Meanwhile, we investigate the relationships among hesitation, distance, similarity and entropy of IFSs to verify the consistency of our work and previous research. Finally, we analyse and discuss the advantages and disadvantages of the proposed similarity measure in detail, and then we apply the proposed measures (dH and SH) to deal with pattern recognition problems, and demonstrate that they outperform state-of-the-art distance and similarity measures.
- 11 January 2018
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 49 (4) , 783-799
New hesitation-based distance and similarity measures on intuitionistic fuzzy sets and their applications
In this paper, we present new definitions on distance and similarity measures between intuitionistic fuzzy sets (IFSs) by combining with hesitation degree. First, we discuss the limitations in traditional distance and similarity measures, which are caused by the neglect of hesitation degree's influence. Even though a vector-valued similarity measure was proposed, which has two components indicating similarity and hesitation aspects, it still cannot perform well in practical applications because hesitation works only when the values of similarity measures are equal. In order to overcome the limitations, we propose new definitions on hesitation, distance and similarity measures, and research some theorems which satisfy the requirements of the proposed definitions. Meanwhile, we investigate the relationships among hesitation, distance, similarity and entropy of IFSs to verify the consistency of our work and previous research. Finally, we analyse and discuss the advantages and disadvantages of the proposed similarity measure in detail, and then we apply the proposed measures (dH and SH) to deal with pattern recognition problems, and demonstrate that they outperform state-of-the-art distance and similarity measures.
- 16 May 2017
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 48 (12) , 2575-2589
New and improved: grey multi-granulation rough sets
Rough set has drawn great attention in recent decades, among which multi-granulation rough set (MGRS) is an arresting direction. It constructs a formal theoretical framework to solve complex problems under the circumstance of multiple binary relations. However, the fusion of multi-granulation rough set and grey system for acquiring knowledge is still a gap. Toward this end, we devise a grey multi-granulation rough set (GMGRS) by taking multiple grey relational relations into consideration under the framework of MGRS. In grey information system, the constructed grey relational relation that measures the relationship among objects can be used to further establish multiple binary relations. Based on two different approximate strategies (seeking common reserving difference and seeking common eliminating difference), two types of GMGRS are presented, respectively. After discussing several important properties of GMGRS, we discover that the properties of the proposed GMGRS are synchronous with the classical MGRS. Meanwhile, to obtain the attribute reduction under GMGRS, we reconstruct significance measure and termination criterion based on the θ-precision pessimistic GMGRS. Last but not least, theoretical studies and practical examples demonstrate that our proposed GMGRS largely enrich the MGRS theory and provide a new technique for knowledge discovery, which is practical in real-world scenarios.
- 16 May 2017
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 48 (12) , 2575-2589
New and improved: grey multi-granulation rough sets
Rough set has drawn great attention in recent decades, among which multi-granulation rough set (MGRS) is an arresting direction. It constructs a formal theoretical framework to solve complex problems under the circumstance of multiple binary relations. However, the fusion of multi-granulation rough set and grey system for acquiring knowledge is still a gap. Toward this end, we devise a grey multi-granulation rough set (GMGRS) by taking multiple grey relational relations into consideration under the framework of MGRS. In grey information system, the constructed grey relational relation that measures the relationship among objects can be used to further establish multiple binary relations. Based on two different approximate strategies (seeking common reserving difference and seeking common eliminating difference), two types of GMGRS are presented, respectively. After discussing several important properties of GMGRS, we discover that the properties of the proposed GMGRS are synchronous with the classical MGRS. Meanwhile, to obtain the attribute reduction under GMGRS, we reconstruct significance measure and termination criterion based on the θ-precision pessimistic GMGRS. Last but not least, theoretical studies and practical examples demonstrate that our proposed GMGRS largely enrich the MGRS theory and provide a new technique for knowledge discovery, which is practical in real-world scenarios.
- 1 January 2012
- Published by Springer Nature
- p. 427-432
Improved Collaborative Filtering Method Applied in Movie Recommender System
- 1 January 2012
- Published by Springer Nature
- p. 427-432
Improved Collaborative Filtering Method Applied in Movie Recommender System
- 1 March 2011
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 42 (3) , 389-396
A kind of BP neural network algorithm based on grey interval
In order to improve the learning ability of a forward neural network, in this article, we incorporate the feedback back-propagation (FBBP) and grey system theory to consider the learning and training of a neural network new perspective. By reducing the input grey degree we optimise the input of the neural network to make it more rational for learning and training of neural networks. Simulation results verified the efficiency of the proposed algorithm by comparing its performance with that of FBBP and classic back-propagation (BP). The results showed that the proposed algorithm has the characteristics of fast training and strong ability of generalisation and it is an effective learning method.
- 1 March 2011
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 42 (3) , 389-396
A kind of BP neural network algorithm based on grey interval
In order to improve the learning ability of a forward neural network, in this article, we incorporate the feedback back-propagation (FBBP) and grey system theory to consider the learning and training of a neural network new perspective. By reducing the input grey degree we optimise the input of the neural network to make it more rational for learning and training of neural networks. Simulation results verified the efficiency of the proposed algorithm by comparing its performance with that of FBBP and classic back-propagation (BP). The results showed that the proposed algorithm has the characteristics of fast training and strong ability of generalisation and it is an effective learning method.
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01,p. 1-4
The Method of Data Pre-processing in Grey Information Systems
In this paper, a method of data pre-processing in grey information systems was proposed to deal with grey information. The binning technique was introduced to smooth noisy data used for grey relative analysis. It constructed the function of grey relative coefficient for each null value and filled up the null value with the solution of the function. It also can be used to detect noisy data. This method is an application of grey system theory in data pre-processing. It has great significance in filling up null values and detecting noisy data in the "poor" information database
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01,p. 1-4
The Method of Data Pre-processing in Grey Information Systems
In this paper, a method of data pre-processing in grey information systems was proposed to deal with grey information. The binning technique was introduced to smooth noisy data used for grey relative analysis. It constructed the function of grey relative coefficient for each null value and filled up the null value with the solution of the function. It also can be used to detect noisy data. This method is an application of grey system theory in data pre-processing. It has great significance in filling up null values and detecting noisy data in the "poor" information database
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 7234-7238
A Method for the Production Scheduling of Workshop Based on the Network
A method for the production scheduling based on the network is put forward in this paper. It is suitable for the production arranging for those complicated products that have a lot of procedures and long production lead-time and are generally put into production in one unit. It is proved that the method improves the agility and efficiency of arranging shop production schedule. The production is carried out according to the method and the number of delayed orders decrease
- 1 January 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 7234-7238
A Method for the Production Scheduling of Workshop Based on the Network
A method for the production scheduling based on the network is put forward in this paper. It is suitable for the production arranging for those complicated products that have a lot of procedures and long production lead-time and are generally put into production in one unit. It is proved that the method improves the agility and efficiency of arranging shop production schedule. The production is carried out according to the method and the number of delayed orders decrease