Jingjing Zeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jingjing Zeng has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Bin Zou
Hubei University
3 shared publications - Jie Xu
Faculty of Computer Science and Information Engineering, Hubei Key Laboratory of Big Data Intelligent Analysis and Application (Hubei University), Engineering Research Center of Hubei Province in Intelligent Government Affairs and Application of Artificial Intelligence, Hubei University, Wuhan, China
3 shared publications - Yimo Qin
School of Mathematics and Statistics, Central South University, Changsha 410083, P. R. China
2 shared publications - Kunjin Zou
Manchester Metropolitan Joint Institute, Hubei University, Wuhan 430062, P. R. China
1 shared publication - Peipei Dong1 shared publication
- Yujing Shen
Faculty of Mathematics and Statistics, Hubei University, Wuhan 430062, P. R. China
1 shared publication
Latest Publications
- 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
- 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.