Zhijian Zhou
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
Zhijian Zhou has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
Huiru Wang
College of Science, Beijing Forestry University, Haidian, China
6 shared publicationsSijie Lu
Department of Mathematics, College of Science, China Agricultural University, Beijing, People's Republic of China
3 shared publicationsYitian Xu
College of Science, China Agricultural University, Haidian, China
3 shared publications- Biao Qi
China Agricultural University
1 shared publication Biyan Dai
China Agricultural University
1 shared publicationChunmei Wang
College of Science, China Agricultural University, Haidian, China
1 shared publication
Latest Publications
- 6 May 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (14) , 6591-6618
Ramp loss KNN-weighted multi-class twin support vector machine
- 6 May 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (14) , 6591-6618
Ramp loss KNN-weighted multi-class twin support vector machine
- 25 October 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (7) , 8259-8278
Reductive and effective discriminative information-based nonparallel support vector machine
- 25 October 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (7) , 8259-8278
Reductive and effective discriminative information-based nonparallel support vector machine
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 161-166
A Method for Identifying Abnormal Building Energy Consumption Using Fuzzy Model
This paper proposes a method for identifying abnormal energy consumption based on building big data and fuzzy models, which can accurately identify abnormal energy consumption in buildings. Firstly, building big data is collected and extracted to construct various building energy data sets; Secondly, on the basis of the constructed building energy consumption sets, the k-means clustering method is used to construct a fuzzy model of normal energy consumption; Finally, through the matching degree of each real-time building energy consumption data with the normal energy consumption fuzzy model, it is judged whether there is abnormal energy consumption behavior in the building. The experimental results show that the method proposed in this paper has a good effect on the recognition of abnormal energy consumption conditions.
- 1 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 161-166
A Method for Identifying Abnormal Building Energy Consumption Using Fuzzy Model
This paper proposes a method for identifying abnormal energy consumption based on building big data and fuzzy models, which can accurately identify abnormal energy consumption in buildings. Firstly, building big data is collected and extracted to construct various building energy data sets; Secondly, on the basis of the constructed building energy consumption sets, the k-means clustering method is used to construct a fuzzy model of normal energy consumption; Finally, through the matching degree of each real-time building energy consumption data with the normal energy consumption fuzzy model, it is judged whether there is abnormal energy consumption behavior in the building. The experimental results show that the method proposed in this paper has a good effect on the recognition of abnormal energy consumption conditions.
- 8 August 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 33 (8) , 3781-3798
Twin-parametric margin support vector machine with truncated pinball loss
- 8 August 2020
- Published by Springer Nature in Neural Computing and Applications
- Vol. 33 (8) , 3781-3798
Twin-parametric margin support vector machine with truncated pinball loss
- 18 May 2020
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 51 (8) , 1448-1463
Ramp loss for twin multi-class support vector classification
Twin K-class support vector classification (TKSVC) adopts ‘One-vs.-One-vs.-Rest’ structure to utilise all the samples to increase the prediction accuracy. However, TKSVC is sensitive to noises or outliers due to the use of the Hinge loss function. To reduce the negative influence of outliers, in this paper, we propose a more robust algorithm termed as Ramp loss for twin K-class support vector classification (Ramp-TKSVC) where we use the Ramp loss function to substitute the Hinge loss function in TKSVC. Because the Ramp-TKSVC is a non-differentiable non-convex optimisation problem, we adopt Concave–Convex Procedure (CCCP) to solve it. To overcome the drawbacks of conventional multi-classification methodologies, the TKSVC is utilised as a core of our Ramp-TKSVC. In the Ramp-TKSVC, the outliers are prevented from becoming support vectors, thus they are not involved in the construction of hyperplanes, making the Ramp-TKSVC more robust. Besides, the Ramp-TKSVC is sparser than the TKSVC. To verify the validity of our Ramp-TKSVC, we conduct experiments on 12 benchmark datasets in both linear and nonlinear cases. The experimental results indicate that our algorithm outperforms the other five compared algorithms.
- 18 May 2020
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 51 (8) , 1448-1463
Ramp loss for twin multi-class support vector classification
Twin K-class support vector classification (TKSVC) adopts ‘One-vs.-One-vs.-Rest’ structure to utilise all the samples to increase the prediction accuracy. However, TKSVC is sensitive to noises or outliers due to the use of the Hinge loss function. To reduce the negative influence of outliers, in this paper, we propose a more robust algorithm termed as Ramp loss for twin K-class support vector classification (Ramp-TKSVC) where we use the Ramp loss function to substitute the Hinge loss function in TKSVC. Because the Ramp-TKSVC is a non-differentiable non-convex optimisation problem, we adopt Concave–Convex Procedure (CCCP) to solve it. To overcome the drawbacks of conventional multi-classification methodologies, the TKSVC is utilised as a core of our Ramp-TKSVC. In the Ramp-TKSVC, the outliers are prevented from becoming support vectors, thus they are not involved in the construction of hyperplanes, making the Ramp-TKSVC more robust. Besides, the Ramp-TKSVC is sparser than the TKSVC. To verify the validity of our Ramp-TKSVC, we conduct experiments on 12 benchmark datasets in both linear and nonlinear cases. The experimental results indicate that our algorithm outperforms the other five compared algorithms.
- 12 January 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (6) , 2301-2314
All-in-one multicategory Ramp loss maximum margin of twin spheres support vector machine
- 12 January 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (6) , 2301-2314
All-in-one multicategory Ramp loss maximum margin of twin spheres support vector machine
- 13 September 2018
- Published by DEStech Publications in DEStech Transactions on Computer Science and Engineering
- No. cmsms
Random Projection for Linear 2-norm Support Vector Machine
The linear 2-norm Support Vector Machine (L2-SVM) builds a hyper-plane which maximizes the 2-norm soft margin. Random projection is a new oblivious feature extraction and dimension reduction method. Both techniques are widely applied in compressed sensing, texture classification, face recognition, and so on. This paper find that random projection can be applied to any input matrix of L2-SVM. Furthermore, we proves that the geometric margin and the minimum enclosing ball in the projected space are almost unchanged with high probability compared with those in the original space. The result is demonstrated by experiments on synthetic and real data. Computational experiments also show that the proposed random projection for L2-SVM has a better performance than random projection for L1-SVM. Besides, the proposed model can solve the large scale classification problems more effectively and efficiently. Moreover, the proposed method is compared with Principal Component Analysis and is applied in Corel images classification problems.
- 13 September 2018
- Published by DEStech Publications in DEStech Transactions on Computer Science and Engineering
- No. cmsms
Random Projection for Linear 2-norm Support Vector Machine
The linear 2-norm Support Vector Machine (L2-SVM) builds a hyper-plane which maximizes the 2-norm soft margin. Random projection is a new oblivious feature extraction and dimension reduction method. Both techniques are widely applied in compressed sensing, texture classification, face recognition, and so on. This paper find that random projection can be applied to any input matrix of L2-SVM. Furthermore, we proves that the geometric margin and the minimum enclosing ball in the projected space are almost unchanged with high probability compared with those in the original space. The result is demonstrated by experiments on synthetic and real data. Computational experiments also show that the proposed random projection for L2-SVM has a better performance than random projection for L1-SVM. Besides, the proposed model can solve the large scale classification problems more effectively and efficiently. Moreover, the proposed method is compared with Principal Component Analysis and is applied in Corel images classification problems.
- 28 March 2018
- Published by Springer Nature
- p. 321-326
A Wine Consumption Prediction Model Based on L-DAGLSSVM
- 28 March 2018
- Published by Springer Nature
- p. 321-326
A Wine Consumption Prediction Model Based on L-DAGLSSVM
- 1 November 2017
- Published by Springer Nature
- p. 280-287
A v-Twin Bounded Support Tensor Machine for Image Classification
- 1 November 2017
- Published by Springer Nature
- p. 280-287
A v-Twin Bounded Support Tensor Machine for Image Classification
- 15 August 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (4) , 1041-1053
An improved ν-twin bounded support vector machine
- 15 August 2017
- Published by Springer Nature in Applied Intelligence
- Vol. 48 (4) , 1041-1053
An improved ν-twin bounded support vector machine