Abstract. The methods for extending binary support vectors machines (SVMs) can be broadly divided into two categories, namely, 1-v-r (one versus rest) and 1-v-1 (one versus one). The 1-v-r approach tends to have higher training time, while 1-v-1 approaches tend to create a large number of binary classifiers that need to be analyzed and stored during the operational phase. This paper describes how rough set theory may help in reducing the storage requirements of the 1-v-1 approach in the operational phase. 