Skip to main content

Using Rough Set to Reduce SVM Classifier Complexity and Its Use in SARS Data Set

  • Conference paper
Book cover Knowledge-Based Intelligent Information and Engineering Systems (KES 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3683))

Abstract

For SVM classifier, Pre-selecting data is necessary to achieve satisfactory classification rate and reduction of complexity. According to Rough Set Theory, the examples in boundary region of a set belong to two or more classes, lying in the boundary of the classes, and according to SVM, support vectors lie in the boundary too. So we use Rough Set Theory to select the examples of boundary region of a set as the SVM classifier set, the complexity of SVM classifier would be reduced and the accuracy maintained. Experiment results of SARS data indicate that our schema is available in both the training and prediction stages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Steinwart: Sparseness of Support Vector Machines.Some Asymptotically Sharp Bounds. In: Thrun, S., Saul, L., Schölkopf, B. (eds.) Advances in Neural Information Processing Systems, vol. 16, MIT Press, Cambridge

    Google Scholar 

  2. Vapnik, V.N.: Statistical Learning Theory. John Wiley & Sons, Chichester (1998)

    MATH  Google Scholar 

  3. Grzymala-Busse, J.: Managing Uncertainty in Expert Systems. Kluwer Academic Publisher, Boston (1991)

    MATH  Google Scholar 

  4. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publisher, Norwell (1991)

    MATH  Google Scholar 

  5. Chang, C., Lin, C.: LIBSVM: a library for support vector machines (2001), Software is available for download at http://www.csie.ntu.edu.tw/~cjlin/libsvm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Honghai, F., Baoyan, L., Cheng, Y., Ping, L., Bingru, Y., Yumei, C. (2005). Using Rough Set to Reduce SVM Classifier Complexity and Its Use in SARS Data Set. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553939_82

Download citation

  • DOI: https://doi.org/10.1007/11553939_82

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28896-1

  • Online ISBN: 978-3-540-31990-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics