Skip to main content
SpringerLink
Log in

Approximation in Formal Concept Analysis

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005)

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

Abstract

We introduce a pair of rough set approximations in formal concept analysis. The proposed approximation operators are defined based on both lattice-theoretic and set-theoretic operators. The properties of the approximation operators are examined. Algorithms for attribute reduction and object reduction in concept lattices are presented.

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

Access this chapter

Log in via an institution
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. Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Pawlak, Z.: Rough Sets Theory and It’s Application to Data Analysis [J]. Cybernetics Systems, An International Journal 29, 661–688 (1998)

    Article  MATH  Google Scholar 

  3. Kryszkiewicz, M.: Rough set approach to incomplete systems. Information Sciences 112, 39–49 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ziarko, W.: Variable precision rough set model. Journal of Computer and System Sciences 46, 39–59 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tsumoto, S.: Automated extraction of medical expert system rules from clinical databases based on rough set theory. Information Sciences 112, 67–84 (1998)

    Article  Google Scholar 

  6. Greco, S., Matarazzo, B., Slowinski, R.: A New Rough Set Approach to Multicriteria and Multiattribute Classification. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 60–67. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Lin, T.Y., Liu, Q.: Rough approximate operators: axiomatic rough set theory. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 256–260. Springer, Berlin (1994)

    Google Scholar 

  8. Quafafou, M.: α-RST: a generalization of rough set theory. Information Science 124, 301–316 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Slowinski, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations. In: Paul, P. (ed.) Advances in Machine Intelligence and Soft-Computing. Department of Electrical Engineering, pp. 17–33. Duke University, Durham (1997)

    Google Scholar 

  10. Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logic. Intelligent Automation and Soft Computing, An International Journal 2, 103–120 (1996)

    Google Scholar 

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

    Google Scholar 

  12. Gediga, G., Wille, R.: Formal Concept Analysis. In: Mathematic Foundations, Springer, Berlin (1999)

    Google Scholar 

  13. Chaudron, L., Maille, N.: Generalized formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 357–370. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Deogun, J.S., Saqer, J.: Monotone concepts for formal concept analysis. Discrete Applied Mathematics 144, 70–78 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Yao, Y.Y.: Concept lattices in rough set theory. In: Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society, pp. 796–801 (2004)

    Google Scholar 

  16. Gediga, G., Duentsch, I.: Modal-style operators in qualitative data analysis. In: Rroceedings of the 2002 IEEE International Conference on Data Mining, pp. 155–162 (2002)

    Google Scholar 

  17. Yao, Y.Y.: A comparative study of formal concept analysis and rough set theory in Data analysis. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 59–68. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Hu, K., Sui, Y., Lu, Y., Wang, J., Shi, C.: Concept approximation in concept lattice. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 167–173. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Kent, R.E.: Rough concept analysis: a synthesis of rough sets and formal concept analysis. Fundamenta Informaticae 27, 169–181 (1996)

    MATH  MathSciNet  Google Scholar 

  20. Saquer, J., Deogun, J.S.: Formal rough concept analysis. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 91–99. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Wolff, K.E.: A conceptual view of knowledge bases in rough set theory. In: Ziarko, W.P., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 220–228. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  22. Shao, M.-W., Zhang, W.-X.: The reduction of concept lattices in rough set theory (2004) (manuscript)

    Google Scholar 

  23. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Google Scholar 

  24. Yao, Y.Y., Chen, Y.: Rough set approximations in formal concept analysis. In: Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society, pp. 73–78 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Science, Institute for Information and System Sciences, Xi’an Jiaotong University, Xi’an, Shaan’xi, 710049, P. R. China

    Ming-Wen Shao & Wen-Xiu Zhang

  2. School of Information Technology, Jiangxi University of Finance & Economics, Nanchang, Jiangxi, 330013, P. R. China

    Ming-Wen Shao

Authors
  1. Ming-Wen Shao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wen-Xiu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Regina, Regina, SK, S4S 0A2 Canada, Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008 Warsaw, P.O. Box, Poland

    Dominik Ślęzak

  2. School of Information Science and Technology, Southwest Jiaotong University, 610031, Chengdu, P.R. China

    Guoyin Wang

  3. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Marcin Szczuka

  4. Department of Computer Science, Brock University, St. Catharines, L2S 3A1, Ontario, Canada

    Ivo Düntsch

  5. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Yiyu Yao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shao, MW., Zhang, WX. (2005). Approximation in Formal Concept Analysis. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_5

Download citation

  • DOI: https://doi.org/10.1007/11548669_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28653-0

  • Online ISBN: 978-3-540-31825-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation