Jie Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jie Xu has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Bin Zou
Hubei University
14 shared publications - Chen Xu
Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada
5 shared publications - Yuan Yan Tang
University of Macau
4 shared publications - Jiangtao Peng
Hubei University
3 shared publications - Jingjing Zeng
Faculty of Mathematics, Wuhan Institute of Technology, Wuhan 430205, P. R. China
3 shared publications - Peipei Dong3 shared publications
Latest Publications
- 28 October 2026
- Published by Elsevier in Information Fusion
- Vol. 139
Multi-classifier fusion of sparse neural networks via regularization-induced diversity
- 28 October 2026
- Published by Elsevier in Information Fusion
- Vol. 139
Multi-classifier fusion of sparse neural networks via regularization-induced diversity
- 12 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
Understanding generalization and consistency of DCNN from weak dependence perspective
- 12 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
Understanding generalization and consistency of DCNN from weak dependence perspective
- 15 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
Hybrid learning framework integrating fisher linear discriminant and localized support vector machines
- 15 October 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 299
Hybrid learning framework integrating fisher linear discriminant and localized support vector machines
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-12
Domain Fusion Contrastive Learning for Cross-Scene Hyperspectral Image Classification
Recently domain adaptation methods based on contrastive learning are widely used to solve the cross-scene classification problem. However, existing contrastive learning methods only focus on source domain or target domain features, or do not adequately consider the interaction of domain information, thus the learned domain-invariant features still have large discrepancies. To address this problem, we propose a novel domain fusion contrastive learning (DFCL) framework for cross-scene hyperspectral image (HSI) classification. DFCL employs an inter-domain, intra-domain dual domain fusion strategy at the feature level, which introduces domain information as a noise interference term for sample enhancement. With the interference of domain information, same category samples are pulled closer and different categories samples are pushed further apart to learn more discriminative features. In addition, we construct an intermediate domain through the source and target domains and define a feature space loss that measures domain discrepancy by feature similarity and label similarity. Finally, a progressive selection strategy based on prototype learning is proposed to select high-confidence pseudo-labels for domain fusion contrastive learning. Experiments on three HSI cross-scene datasets show that the proposed method is superior to existing domain adaptation methods.
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-12
Domain Fusion Contrastive Learning for Cross-Scene Hyperspectral Image Classification
Recently domain adaptation methods based on contrastive learning are widely used to solve the cross-scene classification problem. However, existing contrastive learning methods only focus on source domain or target domain features, or do not adequately consider the interaction of domain information, thus the learned domain-invariant features still have large discrepancies. To address this problem, we propose a novel domain fusion contrastive learning (DFCL) framework for cross-scene hyperspectral image (HSI) classification. DFCL employs an inter-domain, intra-domain dual domain fusion strategy at the feature level, which introduces domain information as a noise interference term for sample enhancement. With the interference of domain information, same category samples are pulled closer and different categories samples are pushed further apart to learn more discriminative features. In addition, we construct an intermediate domain through the source and target domains and define a feature space loss that measures domain discrepancy by feature similarity and label similarity. Finally, a progressive selection strategy based on prototype learning is proposed to select high-confidence pseudo-labels for domain fusion contrastive learning. Experiments on three HSI cross-scene datasets show that the proposed method is superior to existing domain adaptation methods.
- 12 November 2024
- Published by Elsevier in Neural Networks
- Vol. 181, 106885
ALR-HT: A fast and efficient Lasso regression without hyperparameter tuning
- 12 November 2024
- Published by Elsevier in Neural Networks
- Vol. 181, 106885
ALR-HT: A fast and efficient Lasso regression without hyperparameter tuning
- 10 July 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (06)
Functional incremental least square regression algorithm
Functional linear regression is one of the main modeling tools for working with functional data. Since functional data are usually stream data essentially and there are some noises in functional data. Many numerical research studies of machine learning indicate that the noise samples not only increase the amount of storage space, but also affect the performance of algorithm. Therefore, in this paper we consider a new learning strategy by introducing incremental learning, Markov sampling for functional linear regression and propose a novel functional incremental linear square regression algorithm based on Markov sampling (FILSR-MS). To have a better understanding of the proposed FILSR-MS, we not only estimate the generalization bound of the proposed algorithm and establish the fast learning rate, but also present some useful discussions. The performance of the proposed algorithm is validated by the numerical experiments for benchmark repository.
- 10 July 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (06)
Functional incremental least square regression algorithm
Functional linear regression is one of the main modeling tools for working with functional data. Since functional data are usually stream data essentially and there are some noises in functional data. Many numerical research studies of machine learning indicate that the noise samples not only increase the amount of storage space, but also affect the performance of algorithm. Therefore, in this paper we consider a new learning strategy by introducing incremental learning, Markov sampling for functional linear regression and propose a novel functional incremental linear square regression algorithm based on Markov sampling (FILSR-MS). To have a better understanding of the proposed FILSR-MS, we not only estimate the generalization bound of the proposed algorithm and establish the fast learning rate, but also present some useful discussions. The performance of the proposed algorithm is validated by the numerical experiments for benchmark repository.
- 27 June 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (06)
Generalization bounds of incremental SVM
Incremental learning is one of the effective methods of learning from the accumulated training samples and the large-scale dataset. The main advantages of incremental learning consist of making full use of historical information, reducing the training scale greatly and saving space and time consumption. Despite extensive research on incremental support vector machine (SVM) learning algorithms, most of them are based on independent and identically distributed samples (i.i.d.). Not only that, there has been no theoretical analysis of incremental SVM learning algorithms. In this paper, we mainly study the generalization bounds of this incremental SVM learning algorithm whose samples are based on uniformly geometric Markov chains, and exponentially strongly mixing sequence. As a special case, we also obtain the generalization bounds of i.i.d. samples.
- 27 June 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Wavelets, Multiresolution and Information Processing
- Vol. 22 (06)
Generalization bounds of incremental SVM
Incremental learning is one of the effective methods of learning from the accumulated training samples and the large-scale dataset. The main advantages of incremental learning consist of making full use of historical information, reducing the training scale greatly and saving space and time consumption. Despite extensive research on incremental support vector machine (SVM) learning algorithms, most of them are based on independent and identically distributed samples (i.i.d.). Not only that, there has been no theoretical analysis of incremental SVM learning algorithms. In this paper, we mainly study the generalization bounds of this incremental SVM learning algorithm whose samples are based on uniformly geometric Markov chains, and exponentially strongly mixing sequence. As a special case, we also obtain the generalization bounds of i.i.d. samples.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-12
Cross-Channel Dynamic Spatial–Spectral Fusion Transformer for Hyperspectral Image Classification
Convolutional neural network (CNN) has achieved great success in hyperspectral image (HSI) classification. However, the local receptive field of CNN leads to the drawback in extracting long-distance features. Transformer has excellent global modeling ability and shows good performance for HSI classification. The existing Transformer-based methods usually ignore a problem that the spatial information varies under different channels. To well describe the cross-channel dependencies, a cross-channel dynamic spatial-spectral fusion transformer (CDSFT) is proposed in this article. In the proposed CDSFT, the multi-scale and multi-channel features are extracted and then cross-channel global features are extracted through transpose multi-head self-attention (TMHSA). Next, a dynamic feature enhancement module and a spectral spatial position attention module are designed to extract and enhance spectral-spatial joint features for classification. Experimental results on three well-known HSI datasets demonstrate the effectiveness of the proposed CDSFT method.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 61 (01962892) , 1-12
Cross-Channel Dynamic Spatial–Spectral Fusion Transformer for Hyperspectral Image Classification
Convolutional neural network (CNN) has achieved great success in hyperspectral image (HSI) classification. However, the local receptive field of CNN leads to the drawback in extracting long-distance features. Transformer has excellent global modeling ability and shows good performance for HSI classification. The existing Transformer-based methods usually ignore a problem that the spatial information varies under different channels. To well describe the cross-channel dependencies, a cross-channel dynamic spatial-spectral fusion transformer (CDSFT) is proposed in this article. In the proposed CDSFT, the multi-scale and multi-channel features are extracted and then cross-channel global features are extracted through transpose multi-head self-attention (TMHSA). Next, a dynamic feature enhancement module and a spectral spatial position attention module are designed to extract and enhance spectral-spatial joint features for classification. Experimental results on three well-known HSI datasets demonstrate the effectiveness of the proposed CDSFT method.
- 17 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 53 (7) , 4630-4641
Learning Performance of Weighted Distributed Learning With Support Vector Machines
The divide-and-conquer strategy is a very effective method of dealing with big data. Noisy samples in big data usually have a great impact on algorithmic performance. In this article, we introduce Markov sampling and different weights for distributed learning with the classical support vector machine (cSVM). We first estimate the generalization error of weighted distributed cSVM algorithm with uniformly ergodic Markov chain (u.e.M.c.) samples and obtain its optimal convergence rate. As applications, we obtain the generalization bounds of weighted distributed cSVM with strong mixing observations and independent and identically distributed (i.i.d.) samples, respectively. We also propose a novel weighted distributed cSVM based on Markov sampling (DM-cSVM). The numerical studies of benchmark datasets show that the DM-cSVM algorithm not only has better performance but also has less total time of sampling and training compared to other distributed algorithms.
- 17 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 53 (7) , 4630-4641
Learning Performance of Weighted Distributed Learning With Support Vector Machines
The divide-and-conquer strategy is a very effective method of dealing with big data. Noisy samples in big data usually have a great impact on algorithmic performance. In this article, we introduce Markov sampling and different weights for distributed learning with the classical support vector machine (cSVM). We first estimate the generalization error of weighted distributed cSVM algorithm with uniformly ergodic Markov chain (u.e.M.c.) samples and obtain its optimal convergence rate. As applications, we obtain the generalization bounds of weighted distributed cSVM with strong mixing observations and independent and identically distributed (i.i.d.) samples, respectively. We also propose a novel weighted distributed cSVM based on Markov sampling (DM-cSVM). The numerical studies of benchmark datasets show that the DM-cSVM algorithm not only has better performance but also has less total time of sampling and training compared to other distributed algorithms.
- 8 November 2021
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (5) , 3857-3873
LMSVCR: novel effective method of semi-supervised multi-classification
- 8 November 2021
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (5) , 3857-3873
LMSVCR: novel effective method of semi-supervised multi-classification