)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.