Abstract
In this paper, we present a novel approach for approximating concepts in the framework of formal concept analysis. Two main problems are investigated. The first, given a set A of objects (or a set B of features), we want to find a formal concept that approximates A (or B). The second, given a pair (A,B), where A is a set of objects and B is a set of features, the objective is to find formal concepts that approximate (A,B). The techniques developed in this paper use ideas from rough set theory. The approach we present is different and more general than existing approaches.
This research was supported in part by the Army Research O.ce, Grant No. DAAH04-96-1-0325, under DEPSCoR program of Advanced Research Projects Agency, Department of Defense and by the U.S. Department of Energy, Grant No. DE-FG02-9 7ER1220.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carpineto, C., Romano, G.: A lattice Conceptual Clustering System and its Application to Browsing Retrieval. Machine Learning 10, 95–122 (1996)
Godin, R., Missaoui, R.: An Incremental Concept Formation for Learning from Databases. Theoretical Computer Science 133, 387–419 (1994)
Ho, T.B.: An Approach to Concept Formation Based on Formal Concept Analysis. IEICE Trans. Information and Systems E78-D, 553–559 (1995)
Kangassalo, H.: On the concept of concept for conceptual modeling and concept deduction. In: Ohsuga, et al. (eds.) Information Modeling and Knowledge Bases III, pp. 17–58. IOS Press, Amsterdam (1992)
Kent, R.E.: Rough Concept Analysis: A Synthesis of Rough Set and Formal Concept Analysis. Fundamenta Informaticae 27, 169–181 (1996)
Pawlak, Z.: Rough Set Theory and Its Applications to Data Analysis. Cybernetics and Systems 29(7) (1998)
Pawlak, Z.: Rough sets. International Journal of Information and Computer Science 11, 341–356 (1982)
Wille, R.: Restructuring Lattice Theory: an Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered sets, pp. 445–470. Reidel, Dordecht (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saquer, J., Deogun, J.S. (1999). Formal Rough Concept Analysis. In: Zhong, N., Skowron, A., Ohsuga, S. (eds) New Directions in Rough Sets, Data Mining, and Granular-Soft Computing. RSFDGrC 1999. Lecture Notes in Computer Science(), vol 1711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48061-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-48061-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66645-5
Online ISBN: 978-3-540-48061-7
eBook Packages: Springer Book Archive