Reducing Concept Lattices from Rough Set Theory
Due to real databases usually contain redundant information, reducing them preserving the main information is one of the most important branches of study within the theory of Formal Concept Analysis (FCA). Taking advantage of the close relationship between Rough Set Theory (RST) and FCA, in this work, we address the problem of attribute reduction in FCA using the reduction mechanism given in RST. We analyze the properties obtained from this kind of reduction and show an illustrative example.
KeywordsAttribute reduction Formal concept analysis Rough set theory
- 6.Dias, S., Vieira, N.: Reducing the size of concept lattices: the JBOS approach. In: 7th International Conference on Concept Lattices and Their Applications (CLA 2010), vol. 672, pp. 80–91 (2010)Google Scholar
- 9.Medina, J., Ojeda-Aciego, M., Ruiz-Calviño, J.: On multi-adjoint concept lattices: definition and representation theorem. Technical report, University of Málaga (2006). http://www.satd.uma.es/matap/jmedina/MACL.zip
- 11.Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems, pp. 331–362. Springer, Netherlands (1992)Google Scholar