Skip to main content
SpringerLink
Log in

Knowledge Reduction in Formal Contexts Based on Covering Rough Sets

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2009)

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

Included in the following conference series:

Abstract

Rough set theory and formal concept analysis are two approaches for data analysis related to each other, formal contexts are their common framework. In this paper, by investigating relationship between covering rough set and concept lattice, we study attribute reduction of formal context. Judgement theorems of consistent attribute sets and reduct attribute sets are given.

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. Wille, R.: Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. Reidel, Dordrecht (1982)

    Chapter  Google Scholar 

  2. Carpineto, C., Romano, G.: A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval. Machine Learning 10, 95–122 (1996)

    Google Scholar 

  3. Harms, S.K., Deogum, J.S.: Sequential Association Rule Mining with Time Lags. Journal of Intelligent Information Systems 22(1), 7–22 (2004)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  5. Bonikowski, Z., Bryniariski, E., Skardowska, V.W.: Extension and Intensions in the Rough Set Theory. Information Sciences 107, 149–167 (1998)

    Article  MATH  Google Scholar 

  6. Zhu, W., Wang, F.Y.: Reduction and Axiomization of Covering Generalized Rough Sets. Information Sciences 152, 217–230 (2003)

    Article  MATH  Google Scholar 

  7. Li, T.J.: Rough Approximation Operators in Covering Approximation Spaces. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS, vol. 4259, pp. 174–182. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Wong, S.K.M., Wang, L.S., Yao, Y.Y.: Interval Structure: a Framework for Representing Uncertain Information. In: 8th Conference on Uncertainty in Artificial Intelligence, pp. 336–343. Morgan Kaufmann, San Francisco (1992)

    Chapter  Google Scholar 

  9. Yao, Y.Y.: Two Views of the Theory of Rough Sets in Finite Universe. International Journal of Approximate Reasoning 15, 291–317 (1996)

    Article  MATH  Google Scholar 

  10. Li, T.J.: Rough Approximation Operators on Two Universes of Discourse and Their Fuzzy Extensions. Fuzzy Sets and Systems 159, 3033–3050 (2008)

    Article  MATH  Google Scholar 

  11. Hu, K., Sui, Y., Lu, Y., Wang, J., Shi, C.: Concept Approximation in Concept Lattice, Knowledge Discovery and Data Mining. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS, vol. 2035, pp. 167–173. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Yao, Y.Y.: Concept Lattices in Rough Set Theory. In: Proceedings of 23rd International Meeting of the North American Fuzzy Information Processing Society, pp. 796–801 (2004)

    Google Scholar 

  13. Yao, Y.Y.: A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis. In: 3rd International Conference on Rough Sets and Current Trends in Computing, pp. 59–68 (2004)

    Google Scholar 

  14. Shao, M.W., Zhang, W.X.: The Set Approximation in Formal Contexts. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS, vol. 3641, pp. 43–53. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Liu, M., Shao, M., Zhang, W., Wu, C.: Reduction Method for Concept Lattices Based on Rough Set Theory and Its Application. Computers and Mathematics with Applications 53, 1390–1410 (2007)

    Article  MATH  Google Scholar 

  16. Yao, Y.Y.: Relational Interpretations of Neighborhood Operators and Rough Set Approximation Operators. Information Sciences 111, 239–259 (1998)

    Article  MATH  Google Scholar 

  17. Zhang, W.X., Wei, L., Qi, J.J.: Attribute Reduction Theory and Approach to Concpet Lattice. Science in china: Ser. E Information Science 35(6), 628–639 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, Zhejiang, 316000, P.R. China

    Tong-Jun Li

Authors
  1. Tong-Jun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Surveying and Engineering, University of Southern Queensland, QLD 4350, Australia

    Peng Wen

  2. School of Information Technology, Queensland University of Technology, QLD 4001, Brisbane, Australia

    Yuefeng Li

  3. Institute of Mathematics, Warsaw University of Technology, Koszykowa 86, 02008, Warsaw, Poland

    Lech Polkowski

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

    Yiyu Yao

  5. Faculty of Medicine, Department of Medical Informatics, Shimane University, 89-1 Enya-cho, Izumo, 693-8501, Shimane, Japan

    Shusaku Tsumoto

  6. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, TJ. (2009). Knowledge Reduction in Formal Contexts Based on Covering Rough Sets. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation