Qingshuo Zhang

Qingshuo Zhang

Auto-generated profile, based on publicly available information

Qingshuo Zhang

School of Computer Science and Engineering, Macau University of Science and Technology, Taipa, Macau

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 July 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
QZQingshuo Zhang
Qingshuo Zhang
ETEric C.C. Tsang
Eric C.C. Tsang
QHQiang He
Qiang He
YGYanting Guo
Yanting Guo

28 October 2020 in Complexity
Verified
Journal Article
Open access
QHQiang He
Qiang He
QZQingshuo Zhang
Qingshuo Zhang
WHWANG HENGYOU
WANG HENGYOU
CZChanglun Zhang
Changlun Zhang
One-class support vector machine (OCSVM) is one of the most popular algorithms in the one-class classification problem, but it has one obvious disadvantage: it is sensitive to noise. In order to solve this problem, the fuzzy membership degree is introduced into OCSVM, which makes the samples with different importance have different influences on the determination of classification hyperplane and enhances the robustness. In this paper, a new calculation method of membership degree is proposed and introduced into the fuzzy multiple kernel OCSVM (FMKOCSVM). The combined kernel is used to measure the local similarity between samples, and then, the importance of samples is determined based on the local similarity between training samples, so as to determine the membership degree and reduce the impact of noise. The proposed membership requires only positive data in the calculation process, which is consistent with the training set of OCSVM. In this method, the noise has a smaller membership value, which can reduce the negative impact of noise on the classification boundary. Simultaneously, this method of calculating membership has a higher efficiency. The experimental results show that FMKOCSVM based on proposed local similarity membership is efficient and more robust to outliers than the ordinary multiple kernel OCSVMs.