Skip to main content
SpringerLink
Log in
Book cover

Transactions on Rough Sets XIV pp 37–61Cite as

A Formal Concept Analysis Approach to Rough Data Tables

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 6600))

Abstract

In order to handle very large data bases efficiently, the data warehousing system ICE [1] builds so-called rough tables containing information that is abstracted from certain blocks of the original table. In this article we propose a formal description of such rough tables. We also investigate possibilities of mining them for implicational knowledge. The underyling article is an extended version of [2].

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Infobright: Home page at, http://www.infobright.org

  2. Ganter, B., Meschke, C.: A formal concept analysis approach to rough data tables. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Slezak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS, vol. 5908, pp. 117–126. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Infobright: Community Edition: Technology White Paper, http://www.infobright.org/wiki/662270f87c77e37e879ba8f7ac2ea258/

    Google Scholar 

  4. Infobright: Infobright challenge at PReMI 2009 (2009), http://web.iitd.ac.in/premi09/infobright.pdf

  5. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, Boston, pp. 445–470 (1982); seminal publication on formal concept analysis

    Google Scholar 

  6. Ganter, B., Wille, R.: Formal concept analysis mathematic foundations. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  7. Lakhal, L., Stumme, G.: Efficient Mining of Association Rules Based on Formal Concept Analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3626, pp. 180–195. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Data & Knowledge Engineering 42(2), 189–222 (2002)

    Article  MATH  Google Scholar 

  9. Baader, F., Ganter, B., Sattler, U., Sertkaya, B.: Completing description logic knowledge bases using formal concept analysis. In: Golbreich, C., Kalyanpur, A., Parsia, B. (eds.) OWLED. CEUR Workshop Proceedings, vol. 258, CEUR-WS.org (2007)

    Google Scholar 

  10. Bělohlávek, R., Vychodil, V.: What is a fuzzy concept lattice? In: Vaclav Snasel, R.B. (ed.) OWLED. CEUR Workshop Proceedings, vol. 162, CEUR-WS.org (2005)

    Google Scholar 

  11. Burmeister, P., Holzer, R.: On the treatment of incomplete knowledge in formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, Springer, Heidelberg (2000)

    Google Scholar 

  12. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Norwell (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, TU Dresden, Germany

    Bernhard Ganter & Christian Meschke

Authors
  1. Bernhard Ganter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Meschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Manitoba, R3T 5V6, Winnipeg, MB, Canada

    James F. Peters

  2. University of Warsaw, 02-097, Warsaw, Poland

    Andrzej Skowron  & Dominik Slezak  & 

  3. Kyushu Institute of Technology, 804, Tobata, Kitakyushu, Japan

    Hiroshi Sakai

  4. Jadavpur University, Kolkata, Indian Statistical Institute, Kolkata, India

    Mihir Kumar Chakraborty

  5. Cairo University, Orman, Giza, Egypt

    Aboul Ella Hassanien

  6. Zhangzhou Normal University, Fujian, China

    William Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganter, B., Meschke, C. (2011). A Formal Concept Analysis Approach to Rough Data Tables. In: Peters, J.F., et al. Transactions on Rough Sets XIV. Lecture Notes in Computer Science, vol 6600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21563-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21563-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21562-9

  • Online ISBN: 978-3-642-21563-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation