The approximations in rough concept lattice and approximable concept lattice

Article type: Research Article

Authors: Xiao, Qimei^{a; *} | Lang, Guangming^a | Liu, Wenjun^a | Cai, Mingjie^b

Affiliations: [a] School of Mathematics and Statistics,Changsha University of Science and Technology, Changsha, Hunan,P.R. China | [b] College of Mathematics and Econometrics,Hunan University, Changsha, Hunan,P.R. China

Correspondence: [*] Corresponding author. Qimei Xiao, School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, Hunan 410004, P.R. China. E-mail:domaintheory@hotmail.com.

Abstract: In a formal context, the lower and upper approximations of an arbitrary set of objects are constructed by object-oriented concepts, attribute-oriented concepts, approximable concepts and weak approximable concepts, respectively. We first define the concept of approximations based on lattice-theoretic operators, and the properties of them are discussed. In order to overcome the two shortcomings in the former approximations, we present the concept of approximations based on set-theoretic operators.The study can help further understanding of data analysis using rough set theory and formal concept analysis.

Keywords: Rough sets, (formal) concept, object-oriented concept, approximable concept, weak approximable concept, rough concept lattice, approximable concept lattice

DOI: 10.3233/JIFS-16318

Journal: Journal of Intelligent & Fuzzy Systems, vol. 33, no. 6, pp. 3459-3467, 2017