)space complexity with the size of the training set
the CVM proposed in 2005 has linear time complexity
and the space complexity of CVM is independent of the training set s size.In this paper we proposed a novel method called RSCVM.We first defined the upper and lower approximation of a binary CVM
then extended the definition to the multi class situation.Hence RSCVM combined the CVM and rough set theory.We also gave some experiment results on several real world data sets that illustrated RSCVM s merit of faster speed and less support-vectors.
Survey on Attribute Reduction Algorithm of Rough Set
Boundary Thinking for Cognitive Uncertainty Problems
The Least Upper Approximation of Concept
Study on Visual Navigation in Dynamic Environment Based on Finite-State Rough Set Theory
Analysis of Several Reduction Standards and Their Relationship for Inconsistent Decision Table
Related Author
ZHOU Tao
LU Hui-ling
HUO Bing-qiang
REN Hai-ling
WANG Guo-yin
CHENG Yun-long
GAO Man
ZHAO Fan
Related Institution
School of Computer Science and Engineering, North Minzu University
School of Science, Ningxia Medical University
Key Laboratory of Images & Graphics Intelligent Processing of State Ethnic Affairs Commission, North Minzu University
The First People’s Hospital of Yinchuan City
Chongqing Key Laboratory of Brain-Inspired Cognitive Computing and Educational Rehabilitation for Children with Special Needs, Chongqing Normal University