Skip to main content

Rough Sets and FCA – Scalability Challenges

  • Conference paper
  • 1090 Accesses

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

Abstract

Rough Sets (RS) [1,2,3] and Formal Concept Analysis (FCA) [4,5] provide foundations for a number of methods useful in data mining and knowledge discovery at different stages of data preprocessing, classification and representation. RS and FCA are often applied together with other techniques in order to cope with real-world challenges. It is therefore important to investigate various ways of extending RS/FCA notions and algorithms in order to facilitate dealing with truly large and complex data. This talk attempts to categorize some ideas of how to scale RS and FCA methods with respect to a number of objects and attributes, as well as types and cardinalities of attribute values. We discuss a usage of analytical database engines [6] and randomized heuristics [7] to compute approximate, yet meaningful results. We also discuss differences and similarities in algorithmic bottlenecks related to RS and FCA, illustrating that these approaches should be regarded as complementary rather than competing methodologies. As a case study, we consider the tasks of data analysis and knowledge representation arising within a research project aiming at enhancing semantic search of diverse types of content in a large repository of scientific articles [8].

Partly supported by grant 2011/01/B/ST6/03867 from Ministry of Science and Higher Education of Republic of Poland, and National Centre for Research and Development (NCBiR) under grant SP/I/1/77065/10 by strategic scientific research and experimental development program: “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

References

  1. Pawlak, Z., Skowron, A.: Rudiments of Rough Sets. Inf. Sci. 177(1), 3–27 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Pawlak, Z., Skowron, A.: Rough Sets and Boolean Reasoning. Inf. Sci. 177(1), 41–73 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Pawlak, Z., Skowron, A.: Rough Sets: Some Extensions. Inf. Sci. 177(1), 28–40 (2007)

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Poelmans, J., Kuznetsov, S., Ignatov, D., Dedene, G., Elzinga, P., Viaene, S.: Formal Concept Analysis in Knowledge Processing: A Survey on Models and Techniques. Inf. Sci. (2012)

    Google Scholar 

  5. Poelmans, J., Ignatov, D., Kuznetsov, S., Dedene, G., Elzinga, P., Viaene, S.: Formal Concept Analysis in Knowledge Processing: A Survey on Applications. Inf. Sci. (2012)

    Google Scholar 

  6. Ślęzak, D., Synak, P., Toppin, G., Wróblewski, J., Borkowski, J.: Rough SQL - Semantics and Execution. In: Proc. of IPMU (to appear, 2012)

    Google Scholar 

  7. Ślęzak, D., Janusz, A.: Ensembles of Bireducts: Towards Robust Classification and Simple Representation. In: Kim, T.-H., Adeli, H., Ślęzak, D., Sandnes, F.E., Song, X., Chung, K.-I., Arnett, K.P. (eds.) FGIT 2011. LNCS, vol. 7105, pp. 64–77. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  8. Ślęzak, D., Janusz, A., Świeboda, W., Nguyen, H.S., Bazan, J.G., Skowron, A.: Semantic Analytics of PubMed Content. In: Holzinger, A., Simonic, K.-M. (eds.) USAB 2011. LNCS, vol. 7058, pp. 63–74. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ślęzak, D. (2012). Rough Sets and FCA – Scalability Challenges. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds) Formal Concept Analysis. ICFCA 2012. Lecture Notes in Computer Science(), vol 7278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29892-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29892-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29891-2

  • Online ISBN: 978-3-642-29892-9

  • eBook Packages: Computer ScienceComputer Science (R0)