Abstract
Concept lattice and rough set theory, two different methods for knowledge representation and knowledge discovery, are successfully applied to many fields. Methods of fuzzy rule extraction based on rough set theory are rarely reported in incomplete interval-valued fuzzy information systems. Thus, this paper deals with the relationship of such systems and fuzzy concept lattice. The purpose of this paper is to study a new model called rough fuzzy concept lattice (RFCL) and its properties.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- Rough fuzzy concept lattice
- Fuzzy concept lattice
- Rough set theory
- Fuzzy formal context
- Fuzzy formal concept
- Fuzzy equivalence class
1 Introduction
With the development of computer science, more and more attention is paid to the research of its mathematical foundations which have been the common field of mathematicians and computer scientists. Domain theory (DT), formal concept analysis (FCA) and rough set theory (RST) are three important crossing fields based on relations (orders) and simultaneously related to topology, algebra, logic, etc., and provide mathematical foundations for computer science and information science.
In this paper, a covariant Galois connection is put forward by approximation operators of rough sets, thus rough fuzzy concept lattice is established. We also discuss its properties and attribute reduction of fuzzy format concept based on rough fuzzy concept lattice. So profoundly reveals the connection of two knowledge discovery tool, to prepare for the better application prospect.
2 Rough Fuzzy Concept Lattices
Definition 1
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties and \({\tilde{I}} (U \times A \rightarrow [0,1]) \) is a fuzzy binary relations defined in object set to the set of properties. For \(x \in U\), \(a \in A\),
\(I_\delta \left( {x,a} \right) =\left\{ {\begin{array}{l} 1,\tilde{I}\left( {x,a} \right) \ge \delta \\ 0,\tilde{I}\left( {x,a} \right) <\delta \\ \end{array}} \right. \quad I_{\overline{\delta }} \left( {x,a} \right) =\left\{ {\begin{array}{l} 1,\tilde{I}\left( {x,a} \right) >\delta \\ 0,\tilde{I}\left( {x,a} \right) \le \delta \\ \end{array}} \right. \quad 0\le \delta \le 1\) is respectively called \(\delta \) -cross-sectional relationship and \(\delta \) -strong cross sectional relationship.
Definition 2
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, \(I_{\delta }(x,a)\) is a \(\delta \)-cross-sectional relationship. A pair of dual operator between attributes and object set is defined as:
\( X\subseteq U,B\subseteq A. \)
Theorem 1
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where Uis a limited non-null object set, A is a limited non-empty set of properties, \(\forall X_1, X_2, X \subseteq U, \forall B_1, B_2, B \subseteq A\), the following properties are below:
-
(1)
\(X \subseteq B_{\delta }^{\circ } \Leftrightarrow X^{\diamondsuit }_{\delta } \subseteq B\);
-
(2)
\(X_1 \subseteq X_2 \Rightarrow X_{1 \delta }^{\diamondsuit } \supseteq X_{2 \delta }^{\diamondsuit }, B_{1} \subseteq B_{2} \Rightarrow B_{1 \delta }^{\circ } \supseteq B_{2 \delta }^{\circ }\);
-
(3)
\(X\subseteq X_{\delta _{\delta }}^{\diamondsuit ^{\circ }},B_{\delta _{\delta }}^{\circ ^{\diamondsuit }} \subseteq B\);
-
(4)
\(X_{\delta }^{\diamondsuit } =X_{{\delta _{\delta }}_{\delta }}^{{\diamondsuit ^{\circ }}^{\diamondsuit }} ,B_{\delta }^{\circ } =B_{{\delta _{\delta }}_{\delta }}^{\circ ^{{\diamondsuit }^{\circ }}}\);
-
(5)
\(\left( {X_1 \cup X_2 } \right) _{\delta }^{\diamondsuit } =X_{1 \delta }^{\diamondsuit } \cap X_{2 \delta }^{\diamondsuit } ,\left( {B_1 \cup B_2 } \right) _{\delta }^{\circ } =B_{1 \delta }^{\circ } \cap B_{2 \delta }^{\circ }\).
Proof
-
(1)
\(X\subseteq B_\delta ^{\circ } \Leftrightarrow \forall x\in X,x\in B_\delta ^{\circ } \Leftrightarrow \forall x\in B_\delta ^{\circ }, so \left( {x,a} \right) \in I_\delta a\in B\Leftrightarrow \)
\( \forall x\in X, when\left( {x, a} \right) \in I_\delta , \textit{then a} \in B\Leftrightarrow X_\delta ^\diamondsuit \subseteq B. \)
-
(2)
\(X_1 \subseteq X_2 \Rightarrow \forall x\in X_1 \subseteq X_2, when \left( {x, a} \right) \in I_\delta , \textit{so a} \in X_{2 \delta }^{\diamondsuit } \subseteq X_{1 \delta }^\diamondsuit \).
\( B_1 \subseteq B_2 \Rightarrow \forall a\in B_1 \subseteq B_2 \Rightarrow when\left( {x, a} \right) \in I_\delta , \textit{then x} \in B_{2 \delta }^{\circ } \subseteq B_{1 \delta }^{\circ } . \)
-
(3)
\(\forall x\in X\Rightarrow when\left( {x, a} \right) \in I_\delta , \textit{then a} \in X_{\delta }^{\diamondsuit } \Rightarrow \forall a\in X_{\delta }^{\diamondsuit }, when\left( {x, a} \right) \in I_\delta \), then \(x\in X_{\delta }^{\diamondsuit } \Rightarrow X\subseteq X_{\delta }^{\diamondsuit }\). \(\forall a\in B_{\delta _{\delta }}^{\circ ^{\diamondsuit }} \Rightarrow when\left( {x, a} \right) \in I_\delta , \textit{then x} \in B_{\delta }^{\circ } \Rightarrow \forall x\in B_{\delta }^{\circ } , when\left( {x,a} \right) \in I_\delta \), then \(a\in B\Rightarrow B_{\delta _{\delta }}^{\circ ^{\diamondsuit }} \subseteq B\).
-
(4)
For (3) there are clearly \(X_{{\delta _{\delta }}_\delta }^{{\diamondsuit ^{\circ }}^{\diamondsuit }} \subseteq X_{\delta }^{\diamondsuit }\). On the other hand, \(\forall x\in X, when \left( {x, a} \right) \in I_\delta , then \,\, a\in X_{\delta }^{\diamondsuit }\)
\(\Rightarrow \forall a\in X_{\delta }^{\diamondsuit }, when \left( {x, a} \right) \in I_\delta , \textit{so x} \in X_{\delta _{\delta }}^{\diamondsuit ^{\circ }} \Rightarrow \forall x\in X_{\delta _{\delta }}^{\diamondsuit ^{\circ }}, \left( {x, a} \right) \in I_\delta \textit{so a} \in X_{{\delta _{\delta }}_\delta }^{{\diamondsuit ^{\circ }}^\diamondsuit } \Rightarrow \) \(X_{{\delta _{\delta }}_\delta }^{{\diamondsuit ^{\circ }}^\diamondsuit } \supseteq X_{\delta }^{\diamondsuit }, then\,X_{{\delta _{\delta }}_{\delta }}^{{\diamondsuit ^{\circ }}^\diamondsuit } =X_{\delta }^{\diamondsuit }.\,B_{\delta }^{\circ } =B_{{\delta _{\delta }}_\delta }^{{\circ ^{\diamondsuit }}^{\circ }}\) that such.
-
(5)
\(\forall a\in (X_1 \cup X_2 )^{\diamondsuit }, when \left( {x,a} \right) \in I_\delta ,x\in X_1 \cup X_2 \Rightarrow x\in X_1 ,\) then
\(\left( {x,a} \right) \in I_\delta \Rightarrow a\in X_{1 \delta }^{\diamondsuit }, x\in X_{2}, when \left( {x, a} \right) \in I_{\delta },\textit{then a}\in X_{2 \delta }^{\diamondsuit } \Rightarrow a\in X_{1 \delta }^{\diamondsuit } \cap X_{2 \delta }^{\diamondsuit } \Rightarrow \) \(\left( {X_1 \cup X_2 } \right) _{\delta }^{\diamondsuit } \subseteq X_{1 \delta }^{\diamondsuit } \cap X_{2 \delta }^{\diamondsuit }\)
\(\forall a\in X_{1 \delta }^{\diamondsuit } \cap X_{2 \delta }^{\diamondsuit } \Rightarrow a\in X_{1 \delta }^{\diamondsuit } (\left( {x, a} \right) \in I_{\delta } \Rightarrow x\in X_1), \textit{and a} \in X_{2 \delta }^{\diamondsuit }\)
\((\left( {x,a} \right) \in I_\delta \Rightarrow x\in X_2 )\Rightarrow \forall x\in X_1 \cup X_2 , \left( {x,a} \right) \in I_\delta \Rightarrow a\in \)
\(\left( {X_1 \cup X_2 } \right) _{\delta }^{\diamondsuit }. \left( {B_1 \cup B_2 } \right) _{\delta }^{\circ } =B_{1 \delta }^{\circ } \cap B_{2 \delta }^{\circ }\)
is similar to be proved, so omit.
Theorem 2
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for \(X \subseteq U, B \subseteq A\), when \(0<\delta _1 <\delta _2 \le 1\), then \(X_{\delta _{2}}^{\diamondsuit } \subseteq X_{\delta _{1}}^{\diamondsuit }, B_{\delta _{2}}^{\circ } \subseteq B_{\delta _{1}}^{\circ }\).
Proof
\(\forall a\in X_{\delta _2 }^\diamondsuit ,\exists x\in X\Rightarrow \left( {x,a} \right) \in I_{\delta _2 }\,{ thus}\,\tilde{I}\left( {x,a} \right) \ge \delta _2 >\delta _1 \Rightarrow \left( {x,a} \right) \in I_{\delta _1 } \Rightarrow a\in X_{\delta _1 }^\diamondsuit \Rightarrow X_{\delta _2 }^\diamondsuit \subseteq X_{\delta _1 }^\diamondsuit .\)
\(B_{\delta _2 }^{\circ } \subseteq B_{\delta _1 }^{\circ }\) is similar to be proved, so omit.
Definition 6
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for the object set \(X \subseteq U\) and the set of properties set \(B \subseteq A\), the up and down approximate are respectively defined as:
where \(a_\delta ^{\circ } =\left\{ x | x\in U, \left( {x,a} \right) \in I_\delta \right\} ,x_\delta ^\diamondsuit = \left\{ a|a\in A,\left( {x,a} \right) \in I_\delta \right\} \).
Theorem 3
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for the object set \(X\subseteq U\) and the set of properties set \(B\subseteq A\), then \(\left( {\nabla _\delta ,\Delta _\delta }\right) ,\left( {\Delta _\delta ,\nabla _\delta } \right) \) are all Galois connections.
Proof
\(\forall X\subseteq U,B\subseteq A\) \(X\subseteq B_\delta ^\Delta \Leftrightarrow x\in X,x_\delta ^\diamondsuit \cap B\ne \phi \Leftrightarrow when\left( {x,a} \right) \in I_\delta ,so\,a\in B\Leftrightarrow X_\delta ^\nabla \subseteq B\), then \(\left( {\nabla _\delta ,\Delta _\delta } \right) \) is Galois connection; \(( {\Delta _\delta ,\nabla _\delta })\) is similar to be proved, so omit.
Theorem 4
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for the object set \(X \subseteq U\) and the set of properties set \(B\subseteq A\), when \(0<\delta _1 <\delta _2 \le 1\), then
Proof
By the definition, conclusion is easy to proved.
Theorem 5
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for \(\forall X_{1}, X_{2}, X\subseteq U, \forall B_{1}, B_{2}, B\subseteq A\), the up and down approximation have the following properties:
-
(1)
\(X_{1}\subseteq X_{2}\Rightarrow X_{1\delta }^{\nabla }\subseteq X_{2\delta }^{\nabla }, X_{1}\subseteq X_{2}\Rightarrow X_{1\delta }^{\Delta }\subseteq X_{2\delta }^{\Delta },\)
-
(2)
\(B_{1}\subseteq B_{2}\Rightarrow B_{1\delta }^{\nabla }\subseteq B_{2\delta }^{\nabla }, B_{1}\subseteq B_{2}\Rightarrow B_{1\delta }^{\Delta }\subseteq B_{2\delta }^{\Delta },\)
-
(3)
\(X^{\Delta \nabla }_{\delta }\subseteq X \subseteq X^{\Delta \nabla }_{\delta }, B_{\delta }^{\Delta \nabla }\subseteq B\subseteq B_{\delta }^{\Delta \nabla },\)
-
(4)
\(X_{\delta }^{\Delta \nabla \Delta }=X_{\delta }^{\Delta }, X_{\delta }^{\nabla \Delta \nabla }=X_{\delta }^{\nabla }, B_{\delta }^{\Delta \nabla \Delta }= B_{\delta }^{\Delta }, B_{\delta }^{\nabla \Delta \nabla }=B_{\delta }^{\Delta },\)
-
(5)
\((X_{1}\cap X_{2})_{\delta }^{\nabla }=X_{1\delta }^{\nabla }\cap X_{2\delta }^{\nabla },(X_{1}\cup X_{2})_{\delta }^{\Delta }=X_{1\delta }^{\Delta }\cup X_{2\delta }^{\Delta },\)
\((B_{1}\cap B_{2})_{\delta }^{\nabla }=B_{1\delta }^{\nabla }\cap B_{2\delta }^{\nabla },(B_{1}\cup B_{2})_{\delta }^{\Delta }=B_{1\delta }^{\Delta }\cup B_{2\delta }^{\Delta }\)
Proof
(1) \(\forall a\in X_{1\delta }^\nabla \Rightarrow a_\delta ^{\circ } \subseteq X_1 \subseteq X_2 \Rightarrow a\in X_{2\delta }^\nabla \Rightarrow X_{1\delta }^\nabla \subseteq X_{2\delta }^\nabla \).
This proof is similar to (1), so omit.
(3)\(\forall x\in X_{\delta _{\delta }}^{\nabla ^{\Delta }} \Rightarrow x\in \left\{ {x\in U \left| {x_\delta ^{\diamondsuit } \cap X_\delta ^{\nabla } \ne \phi } \right. } \right\} \), then \(a\in A,\)
\(\forall x\in X,\left( {x,a} \right) \in I_\delta \Rightarrow X_{\delta _{\delta }}^{\nabla ^{\Delta }} \subseteq X\).
\( \forall x\in X,so\left( {x,a} \right) \in I_\delta ,a\in X_\delta ^{\diamondsuit } \Rightarrow X_\delta ^{\diamondsuit } \subseteq X_\delta ^{\Delta } \Rightarrow x\in X_{\delta _{\delta }}^{\Delta ^{\nabla }}. \)
\(B_{\delta }^{\nabla ^{\Delta }} \subseteq B \subseteq B_{\delta }^{\Delta \nabla }\) is omitted.
(4) \(a\in X_\delta ^{\Delta \nabla \Delta } \Leftrightarrow a_\delta ^{\circ } \cap X_\delta ^{\Delta \nabla } \ne \phi \Leftrightarrow \left\{ {x\in U\left| {\left( {x,a} \right) \in I_\delta } \right. } \right\} \cap \left\{ {x\in U\left| {x_\delta ^{\diamondsuit } \subseteq X_\delta ^{\Delta }} \right. } \right\} \ne \phi \Leftrightarrow a_\delta ^{\circ }\) \(\cap X\ne \phi ,a\in X_\delta ^{\Delta },\) so \(X_\delta ^{\Delta \nabla \Delta } =X_\delta ^{\Delta } \). Other proof is similar, so omitted.
(5) \(\Leftrightarrow a \in X_{1 \delta }^{\nabla } \cap X_{2 \delta }^\nabla ,\) then \((X_1 \cap X_2)_{\delta }^{\nabla }= X_{1_{\delta }}^{\nabla } \cap X_{2_{\delta }}^{\nabla }\). Other proof is \(a\in \left( {X_1 \cap X_2 } \right) _\delta ^{\nabla } \Leftrightarrow a_\delta ^{\circ } \subseteq X_1 \cap X_2 \Leftrightarrow a_\delta ^{\circ } \subseteq X_1 ,a_\delta ^{\circ } \subseteq X_2 \Leftrightarrow a\in X_{1\delta }^\nabla ,a\in X_{2\delta }^\nabla \) similar, so omitted.
Definition 7
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, for the object set \(X \subseteq U\) and the set of properties set \(B \subseteq A\). If \(X=B_\delta ^{\Delta } ,B=X_\delta ^{\nabla }\), then (X, B) is referred to as the fuzzy concept of object; if \(X=B_\delta ^{\nabla } , B=X_\delta ^{\Delta }\), then (X, B) is referred to as the fuzzy concept of attribution, where X is referred as the extension of fuzzy concept, B is referred as the intension of fuzzy concept.
Definition 8
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, all the concept of fuzzy object and concept of fuzzy attribute sets of \(\left( U,A,{\tilde{I}}\right) \) are recorded as:
Theorem 6
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, on the concept of fuzzy object sets \(L_O \left( {U,A,I_\delta } \right) =\left\{ {\left( {X,B} \right) \left| {X=B_\delta ^{\Delta } ,B=X_\delta ^{\nabla } } \right. } \right\} \) and the concept of fuzzy attribute sets \(L_P \left( {U,A,I_\delta } \right) =\left\{ {\left( {X,B} \right) \left| {X=B_\delta ^{\nabla } ,B=X_\delta ^{\Delta } } \right. } \right\} \), binary relation are recorded as:
Then \(L_O \left( {U,A,I_\delta } \right) \), \(L_P \left( {U,A,I_\delta } \right) \) are all partial order sets.
Proof
(1) reflexivity: \((X_1,B_1) \le (X_1, B_1)\),
(2) symmetry: \((X_1,B_1) \le (X_2, B_2),(X_2, B_2) \le (X_1,B_1) \Rightarrow (X_1,B_1) = (X_2,B_2)\),
(3) transitivity: \((X_1,B_1) \le (X_2, B_2),(X_2, B_2) \le (X_3,B_3) \Rightarrow (X_1,B_1) = (X_3,B_3)\).
Then binary relation \(\le \) is partial order relation, so \(L_O \left( {U,A,I_\delta } \right) \), \(L_P \left( {U,A,I_\delta } \right) \) are all partial order sets.
Theorem 7
Let \(L_O \left( {U,A,I_\delta } \right) \), \(L_P \left( {U,A,I_\delta } \right) \) be partial order sets. For
the join and intersect operation are defined as:
Then \(L_O \left( {U,A,I_\delta } \right) \) \(L_P \left( {U,A,I_\delta } \right) \) are all complete lattices.
Proof
For \(\forall \left( {X_i ,B_i } \right) , \left( {X_k ,B_k } \right) \in L_O \left( {U,A,I_\delta } \right) \), \(i,k\in I\), then
\(\mathop \cap \limits _{i=I} B_i \subseteq \left( {\mathop \cap \limits _{i=I} B_i } \right) _\delta ^{\Delta \nabla } \)then\(\mathop \cap \limits _{i=I} B_i =\left( {\mathop \cap \limits _{i=I} B_i } \right) _\delta ^{\Delta \nabla } \).\(\left( {\mathop \cap \limits _{i\in I} B_i } \right) _\delta ^\Delta =\left( {\mathop \cap \limits _{i\in I} X_{i _\delta } ^\nabla } \right) _\delta ^{\Delta } =\left( {\mathop \cap \limits _{i\in I} X_i } \right) _\delta ^{\nabla \Delta }\)
\(\left( {\left( {\mathop \cap \limits _{i\in I} X_i } \right) _\delta ^{\nabla \Delta } ,\mathop \cap \limits _{i\in I} B_i } \right) = (\left( {\mathop \cap \limits _{i\in I} B_i } \right) _\delta ^\Delta ,\mathop \cap \limits _{i\in I} B_i ) \in L_O \left( {U,A,I_\delta } \right) \), then \(\left( \left( {\mathop \cap \limits _{i\in I} X_i } \right) _\delta ^{\nabla \Delta } ,\right. \left. \mathop \cap \limits _{i\in I} B_i \right) \) is lower bound of \(L_O \left( {U,A,I_\delta } \right) \).
On the other hand, if \(\left( {X,B} \right) \) is a any lower bound of \(L_O \left( {U,A,I_\delta } \right) \), then
so \(\mathop \wedge \limits _{i\in I} \left( {X_i ,B_i } \right) =\left( {\left( {\mathop \cap \limits _{i\in I} X_i } \right) _\delta ^{\nabla \Delta } ,\mathop \cap \limits _{i\in I} B_i } \right) \)
is infimum of \(L_O \left( {U,A,I_\delta } \right) \); for
is supremum of \(L_O \left( {U,A,I_\delta } \right) \), this proof is omitted.
From what has been discussed above, \(L_O \left( {U,A,I_\delta } \right) \) is complete lattices.
The proof about \(L_P \left( {U,A,I_\delta } \right) \) is omitted.
Definition 9
\(\left( U,A,{\tilde{I}}\right) \) is a fuzzy formal context, where U is a limited non-null object set, A is a limited non-empty set of properties, complete lattices
are respectively referred to as fuzzy object concept lattice and fuzzy attribute concept lattice.
3 Conclusion
Concept lattice and rough set theory, two different methods for knowledge representation and knowledge discovery, are successfully applied to many fields. Methods of fuzzy rule extraction based on rough set theory are rarely reported in incomplete interval-valued fuzzy information systems. Thus, this paper deals with the relationship of such systems and fuzzy concept lattice. The purpose of this paper is to study a new model called fuzzy rough concept lattice (FRCL) and its properties. We study four models of FRCL and the relationship of those. Meanwhile transformation algorithms and examples are be given.
References
Belohlavek, R.: Fuzzy galois connection. Math. Log. Quart. 45(4), 497–504 (1991)
Belohlavek, R.: Fuzzy Relational System: Foundation and Principles. Kluwer Academic/Plenum, New York (2002)
Bělohlávek, R., Sklenář, V., Zacpal, J.: Crisply generated fuzzy concepts. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 269–284. Springer, Heidelberg (2005)
Belohlavek, R., Vychodil, V.: Reducing the size of fuzzy concept lattices by hedge. In: FUZZ-IEEE 2005. The IEEE International Conference on Fuzzy Systems, pp. 663–668. Reno (Nevada, USA), 22–25 May 2005
Burusco, A., Fuentes-Gonzales, R.: The study of the L-fuzzy concept lattice. Mathware Soft Comput 1(3), 209–218 (1994)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin (1999)
Zadeh, L.A.: Fuzzy sets. Inform. Control 8, 338–353 (1965)
Yao, Y.Y.: A comparative study of formal concept analysis and rough set theory in data analysis. LNAI 3066, 59–68 (2004)
Yao, Y.Y.: Concept lattices in rough set theory. In: Proceedings of the 23rd International Meeting of the North American Fuzzy Information Processing Society (2004)
Sigayret, A., Berry, A.: Representating a concept lattice by a graph. Discrete Appl. Math. 144, 27–42 (2004)
Yahia, S., Jaoua, A.: Discovering knowledge from fuzzy concept lattice. In: Kandel, A., Last, M., Bunke, H. (eds.) Data Mining and Computational Intelligence, pp. 167–190. Physica-Verlag, Wurzburg (2002)
Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concept. In: Rival, I. (ed.) Ordered Sets, pp. 445–470. BOSTON, Reidel, Dordrecht (1982)
Gediga, G., Wille, R.: Formal Concept Analysis. Mathematic Foundations, Springer, Berlin (1999)
Faid, M., Missaoi, R., Godin, R.: Mining complex structures using context concatenation in formal concept analysis. In: International KRUSE Symposium, Vancouver, BC, 11–13 Aug 1997
Godin, R., Missaoi, R.: An incremental concept formation approach for learning from databases. In: Formal Methods in Databases and Software Engineering, Theoretical Computer Science 133, pp. 387–419 (special issue) (1994)
Wille, R.: Knowledge acquisition by methods of formal concept analysis. In: Diday, E. (ed.) Data Analysis, Learning Symbolic and Numeric Knowledge, pp. 365–380. Nova Science, New York (1989)
Belohlavek, R.: Fuzzy closure operators. J. Math. Anal. Appl. 262, 473–489 (2001)
Belohlavek, R.: Lattices of fixed points of fuzzy Galois connection. Math. Logic Quart. 47, 111–116 (2001)
Belohlavek, R.: Concept lattices and order in fuzzy logic. Ann. Pure Appl. Logic 128, 277–298 (2004)
Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Boston (1991)
Burusco, A., Fuentes-Gonzalez, R.: Construction of the L-fuzzy concept lattices. Fuzzy Sets Syst. 97, 109–114 (1998)
Acknowledgments
Thanks to the support by National Natural Science Foundation of China (No.11071178), Education department of sichuan province (14ZB0065) and Science and technology project funds (K33).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Shu, C., Mo, Zw. (2016). Rough Fuzzy Concept Lattice and Its Properties. In: Cao, BY., Liu, ZL., Zhong, YB., Mi, HH. (eds) Fuzzy Systems & Operations Research and Management. Advances in Intelligent Systems and Computing, vol 367. Springer, Cham. https://doi.org/10.1007/978-3-319-19105-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-19105-8_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19104-1
Online ISBN: 978-3-319-19105-8
eBook Packages: EngineeringEngineering (R0)