Skip to main content
SpringerLink
Log in

Algebras from Semiconcepts in Rough Set Theory

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2018)

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

Included in the following conference series:

Abstract

In this article, we propose a notion of a semiconcept in the framework of Yao’s object oriented concepts. A study of the algebra of such ‘object oriented semiconcepts’ is carried out, in the line of the study by Wille for the algebra of semiconcepts in formal concept analysis. Two further unary operators, ‘semi-topological’ in nature, are introduced on these structures. On abstraction, the properties of these operators lead to the definition of a ‘semi-topological double Boolean algebra’, of which the algebra of object oriented semiconcepts becomes an instance.

P. Howlader—This work is supported by the Council of Scientific and Industrial Research (CSIR) India - Research Grant No. 09/092(0950)/2016-EMR-I.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Düntsch, I., Gediga, G.: Modal-style operators in qualitative data analysis. In: Proceedings of the IEEE International Conference on Data Mining, pp. 155–162 (2002). https://doi.org/10.1109/ICDM.2002.1183898

  2. Düntsch, I., Gediga, G.: Approximation operators in qualitative data analysis. In: de Swart, H., Orłowska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol. 2929, pp. 214–230. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-24615-2_10

    Chapter  Google Scholar 

  3. Ganter, B., Meschke, C.: A formal concept analysis approach to rough data tables. In: Peters, J.F., et al. (eds.) Transactions on Rough Sets XIV. LNCS, vol. 6600, pp. 37–61. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21563-6_3

    Chapter  MATH  Google Scholar 

  4. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (2012)

    MATH  Google Scholar 

  5. 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). https://doi.org/10.1007/3-540-45357-1_21

    Chapter  Google Scholar 

  6. Kent, R.E.: Rough concept analysis. In: Ziarko, W.P. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 248–255. Springer, London (1994). https://doi.org/10.1007/978-1-4471-3238-7_30

    Chapter  Google Scholar 

  7. Kwuida, L.: Prime ideal theorem for double Boolean algebras. Discussiones Math. Gen. Algebra Appl. 27(2), 263–275 (2007). https://doi.org/10.7151/dmgaa.1130

    Article  MathSciNet  MATH  Google Scholar 

  8. Kwuida, L., Pech, C., Reppe, H.: Generalizations of Boolean algebras. An attribute exploration. Math. Slovaca 56(2), 145–165 (2006)

    MathSciNet  MATH  Google Scholar 

  9. Meschke, C.: Approximations in concept lattices. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS (LNAI), vol. 5986, pp. 104–123. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11928-6_8

    Chapter  MATH  Google Scholar 

  10. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982). https://doi.org/10.1007/BF01001956

    Article  MATH  Google Scholar 

  11. Peleg, D.: A generalized closure and complement phenomenon. Discrete Math. 50, 285–293 (1984). https://doi.org/10.1016/0012-365X(84)90055-4

    Article  MathSciNet  MATH  Google Scholar 

  12. Wille, R.: Concept lattices and conceptual knowledge systems. Comput. Math. Appl. 23(6), 493–515 (1992). https://doi.org/10.1016/0898-1221(92)90120-7

    Article  MATH  Google Scholar 

  13. Wille, R.: Boolean concept logic. In: Ganter, B., Mineau, G.W. (eds.) ICCS-ConceptStruct 2000. LNCS (LNAI), vol. 1867, pp. 317–331. Springer, Heidelberg (2000). https://doi.org/10.1007/10722280_22

    Chapter  Google Scholar 

  14. Wille, R.: Boolean judgment logic. In: Delugach, H.S., Stumme, G. (eds.) ICCS-ConceptStruct 2001. LNCS (LNAI), vol. 2120, pp. 115–128. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44583-8_9

    Chapter  Google Scholar 

  15. Wille, R.: Preconcept algebras and generalized double boolean algebras. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 1–13. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24651-0_1

    Chapter  Google Scholar 

  16. Yang, L., Xu, L.: On rough concept lattices. Electron. Notes Theor. Comput. Sci. 257, 117–133 (2009). https://doi.org/10.1016/j.entcs.2009.11.030

    Article  MATH  Google Scholar 

  17. Yao, Y.: Concept lattices in rough set theory. Proce. Ann. Meet. North Am. Fuzzy Inf. Process. Soc. 2, 796–801 (2004). https://doi.org/10.1109/NAFIPS.2004.1337404

    Article  Google Scholar 

  18. Yao, 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). https://doi.org/10.1007/978-3-540-25929-9_6

    Chapter  Google Scholar 

  19. Yao, Y., Chen, Y.: Rough set approximations in formal concept analysis. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 285–305. Springer, Heidelberg (2006). https://doi.org/10.1007/11847465_14

    Chapter  Google Scholar 

Download references

Acknowledgments

We are grateful to the anonymous referees for their suggestions and valuable remarks.

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur, 208016, India

    Prosenjit Howlader & Mohua Banerjee

Authors
  1. Prosenjit Howlader
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohua Banerjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohua Banerjee .

Editor information

Editors and Affiliations

  1. University of Warsaw, Warsaw, Poland

    Hung Son Nguyen

  2. Faculty of Information Technology, Vietnam National University, Hanoi, Vietnam

    Quang-Thuy Ha

  3. School of Information Science, Southwest Jiaotong University, Chengdu, China

    Tianrui Li

  4. Institute of Computer Science, University of Silesia, Sosnowiec, Poland

    Małgorzata Przybyła-Kasperek

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Howlader, P., Banerjee, M. (2018). Algebras from Semiconcepts in Rough Set Theory. In: Nguyen, H., Ha, QT., Li, T., Przybyła-Kasperek, M. (eds) Rough Sets. IJCRS 2018. Lecture Notes in Computer Science(), vol 11103. Springer, Cham. https://doi.org/10.1007/978-3-319-99368-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99368-3_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99367-6

  • Online ISBN: 978-3-319-99368-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation