Skip to main content

Optimization of Concept Discovery in Approximate Information System Based on FCA

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2005)

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

Included in the following conference series:

  • 1452 Accesses

Abstract

This paper proposes the formal description of nondeterministic information system based on tolerance rough set theory, analyzes six cases of approximate information system, and gives the concept of strong and weak similarity. After defining tolerance rough set, combining the theories of FCA and expanding non-definable concept into non-definable attributes, non-definable objects and non-definable context, we present optimal algorithm of formal concept of approximation system. Really emulation has illustrated that the algorithm obtains a satisfied approximate concept and a shorter time complexity.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Shiquan, C., Lichun, C.: Fuzzy Concept Lattice. Fuzzy System and Mathematics 16(4) (2002)

    Google Scholar 

  2. Jarvinen, J.: Knowledge Representation and Rough Sets. Turku Centre for Computer Science, TUCS Dissertations (14), 53-56 (March 1999)

    Google Scholar 

  3. Saquer, J., Deogun, J.S.: Concept Approximations Based on Rough Sets and Similarity Measure. Int. j. Math. Comput. Sci. 11(3), 655–674 (2001)

    MATH  MathSciNet  Google Scholar 

  4. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, Reidel, Dordrecht-Boston, pp. 445–470. Reidel (1982)

    Google Scholar 

  5. Ganter, B., Wille, R.: Formal Begriffsanalyse: Mathematische Grundlagen. Spring, Heidelberg (1996)

    MATH  Google Scholar 

  6. Ganter, B., Wille, R.: Formal Concept Analysis: mathematical foundations (translated from the German by C. Franzke). Springer, Heidelberg (1999)

    Google Scholar 

  7. Kent, R.: Rough Concept Analysis: A Synthesis of Rough Sets and Formal Concept Analysis. Fund. Inform. 27(2), 169–181

    Google Scholar 

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

Jin, H., Wei, C., Wang, X., Fu, J. (2005). Optimization of Concept Discovery in Approximate Information System Based on FCA. In: Wang, L., Jin, Y. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2005. Lecture Notes in Computer Science(), vol 3613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539506_28

Download citation

  • DOI: https://doi.org/10.1007/11539506_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28312-6

  • Online ISBN: 978-3-540-31830-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics