iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/978-1-84628-226-3_22
Reliable Instance Classification with Version Spaces | SpringerLink
Skip to main content

Reliable Instance Classification with Version Spaces

  • Conference paper
Research and Development in Intelligent Systems XXII (SGAI 2005)

Abstract

This paper proposes considering version spaces as an approach to reliable instance classification. The key idea is to construct version spaces containing the hypotheses of the target concept or its close approximations. So, the unanimous-voting classification rule of version spaces does not misclassify; i.e., instance classifications become reliable.

We implement version spaces by testing them for collapse. We show that testing can be done by any learning algorithm and use support vector machines. The resulting combination is called version space support vector machines. Experiments show 100% accuracy and good coverage.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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.

Similar content being viewed by others

References

  1. S. Bay and M. Pazzani. Characterizing model errors and differences. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML-2000), pages 196–201, 2000.

    Google Scholar 

  2. C. Blake and C. Merz. UCI repository of machine learning databases, 1998.

    Google Scholar 

  3. C. Burges. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2):121–167, 1998.

    Article  Google Scholar 

  4. H. Hirsh, N. Mishra, and L. Pitt. Version spaces and the consistency problem. Artificial Intelligence, 156(2):115–138, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Keerthi and C.-J. Lin. Asymptotic behaviors of support vector machines with gaussian kernel. Neural Computation, 15:1667–1689, 2003.

    Article  MATH  Google Scholar 

  6. M. Kukar. Transduction and typicalness for quality assessment of individual classifications in machine learning and data mining. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM-2004), pages 146–153, 2004.

    Google Scholar 

  7. T. Melluish, C. Saunders, I. Nouretdinov, and V. Vovk. Comparing the Bayes and typicalness frameworks. In Proceedings of the 12th European Conference on Machine Learning (ECML-2001), pages 360–371. Springer, 2001.

    Google Scholar 

  8. T. Mitchell. Version spaces: an approach to concept learning. PhD thesis, Electrical Engineering Dept., Stanford University, Stanford, CA, 1978.

    Google Scholar 

  9. T. Mitchell. Machine learning. McGraw-Hill, New York, NY, 1997.

    MATH  Google Scholar 

  10. K. Murray. Multiple convergence: an approach to disjunctive concept acquisition. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87), pages 297–300, Los Altos, CA, 1987. Morgan Kaufmann.

    Google Scholar 

  11. I. Nouretdinov, V. Vovk, V. V’yugin, and A. Gammerman. Transductive confidence machine is universal. Technical report, Department of Computer Science, Royal Holloway, University of London, 2002.

    Google Scholar 

  12. M. Sebag and C. Rouveirol. Resource-bounded relational reasoning: induction and deduction through stochastic matching. Machine Learning, 38(l–2):41–62, 2000.

    Article  MATH  Google Scholar 

  13. E. Smirnov. Conjunctive and disjunctive version spaces with instance-based boundary sets. PhD thesis, Department of Computer Science, Maastricht University, Maastricht, The Netherlands, 2001.

    Google Scholar 

  14. E. Smirnov and H. van den Herik. Applying preference biases to conjunctive and disjunctive version spaces. In Proceedings of the Ninth International Conference on Artificial Intelligence: Methodology, Systems, and Applications (AIMSA-2000), LNAI 1904, pages 321–330, Berlin, Germany, 2000. Springer.

    Google Scholar 

  15. P. Utgoff. Shift of bias for inductive concept learning. PhD thesis, Computer Science Department, Rutgers University, New Brunswick, NJ, 1984.

    Google Scholar 

  16. V. Vapnik. Statistical Learning Theory. John Wiley, NY, 1998.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag London Limited

About this paper

Cite this paper

Smirnov, E.N., Sprinkhuizen-Kuyper, I.G., Nalbantov, G.I. (2006). Reliable Instance Classification with Version Spaces. In: Bramer, M., Coenen, F., Allen, T. (eds) Research and Development in Intelligent Systems XXII. SGAI 2005. Springer, London. https://doi.org/10.1007/978-1-84628-226-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-226-3_22

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-225-6

  • Online ISBN: 978-1-84628-226-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics