Skip to main content
SpringerLink
Log in

Rough Sets over the Boolean Algebras

  • 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

This paper studies some matrix properties of rough sets over an arbitrary Boolean algebra, and their comparison with the corresponding ones of Pawlak’s rough sets, a tool for data mining. The matrix representation of the lower and upper approximation operators of rough sets is given. Matrix approach provides an explicit formula for computing lower and upper approximations. The lower and upper approximation operators of column vector over an arbitrary Boolean algebra are defined. Finally, a set of axioms is constructed to characterize the upper approximation operator of column vector.

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 Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Pawlak, Z.: Rough sets-theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)

    MATH  Google Scholar 

  3. Yao, Y.Y.: Two views of the theory of rough sets in finite universes. International Journal of Approximation Reasoning 15, 291–317 (1996)

    Article  MATH  Google Scholar 

  4. Yao, Y.Y.: On generalizing pawlak approximation operators. In: Polkowski, L., Skowron, A. (eds.) RSCTC 1998. LNCS (LNAI), vol. 1424, pp. 298–307. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Yao, Y.Y.: Constructive and algebraic methods of the rough sets. Information Sciences 109, 21–47 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Give’on, Y.: Lattice matrices. Information and Control 7, 477–484 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  7. Baets, B.D., Meyer, H.D.: On the existence and construction of T-transitive closure. Information Sciences 152, 167–179 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Jarvinen, J.: On the structure of rough approximations. Fundamenta Informaticae 53, 135–153 (2002)

    MathSciNet  Google Scholar 

  9. Grassmann, W.K., Tremblay, J.P.: Logic and discrete mathematics, a computer science perspective. Prentice Hall, Englewood Cliffs (1996)

    Google Scholar 

  10. Banerjee, M., Pal, S.K.: Roughness of a fuzzy set. Information Sciences 93, 235–246 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Sciences, Beijing Language and Culture University, Beijing, 100083, P.R. China

    Gui-Long Liu

Authors
  1. Gui-Long Liu
    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

Liu, GL. (2005). Rough Sets over the Boolean Algebras. 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_13

Download citation

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

  • 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