Skip to main content

Category-Based Inductive Reasoning: Rough Set Theoretic Approach

  • Chapter
Transactions on Rough Sets IX

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 5390))

  • 516 Accesses

Abstract

The present paper is concerned with rough set theory (RST) and a particular approach to human-like induction, namely similarity coverage model (SCM). It redefines basic concepts of RST – such like e.g. a decision rule, accuracy and coverage of decision rules – in the light of SCM and explains how RST may be viewed as a similarity-based model of human-like inductive reasoning. Furthermore, following the knowledge-based theory of induction, we enrich RST by the concept of an ontology and, in consequence, we present an RST-driven conceptualisation of SCM. The paper also discusses a topological representation of information systems in terms of non-Archimedean structures. It allows us to present an ontology-driven interpretation of finite non-Archimedean nearness spaces and, to some extent, to complete recent papers about RST and the topological concepts of nearness.

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. Albatineh, A., Niewiadomska-Bugaj, M., Mihalko, D.: On Similarity Indices and Correction for Chance Agreement. Journal of Classification 23, 301–313 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Atran, S.: Classifying Nature Across Cultures. In: Osherson, D., Smith, E. (eds.) An Invitation to Cognitive Science. Thinking, pp. 131–174. MIT Press, Cambridge (1995)

    Google Scholar 

  3. Deses, D., Lowen-Colebunders, E.: On Completeness in a Non-Archimedean Setting via Firm Reflections. Bulletin of the Belgian Mathematical Society, Special volume: p-adic Numbers in Number Theory, Analytic Geometry and Functional Analysis, 49–61 (2002)

    Google Scholar 

  4. Deses, D.: Completeness and Zero-dimensionality Arising from the Duality Between Closures and Lattices, Ph.D. Thesis, Free University of Brussels (2003), http://homepages.vub.ac.be/~diddesen/phdthesis.pdf

  5. Gomolińska, A.: On Three Closely Related Rough Inclusion Functions. In: Kryszkiewicz, M., Peters, J., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS, vol. 4585, pp. 142–151. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  6. Heit, E.: Properties of Inductive Reasoning. Psychonomic Bulletin & Review 7, 569–592 (2000)

    Article  Google Scholar 

  7. Kloos, H., Sloutsky, V., Fisher, A.: Dissociation Between Categorization and Induction Early in Development: Evidence for Similarity-Based Induction. In: Proceedings of the XXVII Annual Conference of the Cognitive Science Society (2005)

    Google Scholar 

  8. Kulczyński, S.: Die Pflanzenassociationen der Pieninen. Bulletin International de L’Academie Polonaise des Sciences et des letters, classe des sciences mathematiques et naturelles, Serie B, Supplement II 2, 57–203 (1927)

    Google Scholar 

  9. Osherson, D.N., Smith, E.E., Wilkie, O., Lopez, A., Shafir, E.: Category-Based Induction. Psychological Review 97(2), 185–200 (1990)

    Article  Google Scholar 

  10. Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Peters, J., Skowron, A., Stepaniuk, J.: Nearness of Objects: Extension of Approximation Space Model. Fundamenta Informaticae 79, 497–512 (2007)

    MathSciNet  MATH  Google Scholar 

  12. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Boston (1991)

    Book  MATH  Google Scholar 

  13. Polkowski, L., Skowron, A.: Rough Mereology: A New Paradigm for Approximate Reasoning. Int. J. Approx. Reasoning 15(4), 333–365 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Skowron, A., Stepaniuk, J.: Tolerance Approximation Spaces. Fundamenta Informaticae 27, 245–253 (1996)

    MathSciNet  MATH  Google Scholar 

  15. Sloman, S.A.: Feature-Based Induction. Cognitive Psychology 25, 231–280 (1993)

    Article  Google Scholar 

  16. Tsumoto, S.: Extraction of Experts’ Decision Rules from Clinical Databases Using Rough Set Model. Intelligent Data Analysis 2(1-4), 215–227 (1998)

    Article  Google Scholar 

  17. Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht-Boston (1982)

    Chapter  Google Scholar 

  18. Wille, R.: Concept lattices and Conceptual Knowledge Systems. Computers & Mathematics with Applications 23, 493–515 (1992)

    Article  MATH  Google Scholar 

  19. Wolski, M.: Approximation Spaces and Nearness Type Structures. Fundamenta Informaticae 79, 567–577 (2007)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wolski, M. (2008). Category-Based Inductive Reasoning: Rough Set Theoretic Approach. In: Peters, J.F., Skowron, A., Rybiński, H. (eds) Transactions on Rough Sets IX. Lecture Notes in Computer Science, vol 5390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89876-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89876-4_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89875-7

  • Online ISBN: 978-3-540-89876-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics