×

Attribute reductions and concept lattices in interval-valued intuitionistic fuzzy rough set theory: construction and properties. (English) Zbl 1361.68269

Summary: The definition of interval-valued intuitionistic fuzzy (IVIF for short) rough sets is introduced and relative properties are developed. Furthermore, given different threshold values, we discuss the knowledge reduction of IVIF information systems by using the discernibility matrix based on the positive region of decision attributes with regard to some condition attributes set. Finally, the IVIF variable threshold concept lattice and one-sided IVIF concept lattice associated with IVIF formal contexts are given and various methods of construction of these concepts are discussed.

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
68T30 Knowledge representation
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20 pp 87– (1986) · Zbl 0631.03040
[2] Atanassov, Interval-valued intuitionistic fuzzy sets, Fuzzy Sets and Systems 33 (1) pp 343– (1989) · Zbl 0674.03017
[3] Banerjee, Roughness of a fuzzy set, Information Sciences 93 pp 235– (1996) · Zbl 0879.04004
[4] Beynon, Reducts with the variable precision rough sets model: A further investigation, European Journal of Operational Research 134 pp 592– (2001) · Zbl 0984.90018
[5] Boixader, Upper and lower approximations of fuzzy sets, International Journal of General Systems 29 pp 555– (2000) · Zbl 0955.03056
[6] Chakrabarty, Intuitionistic fuzzy rough sets, in: Proceedings of the Fourth Joint Conference on Information Sciences (JCIS) pp 211– · Zbl 1360.03084
[7] Cornelis, Classification of intuitionistic fuzzy implicators: An algebraic approach, in: Proceedings of Sixth Joint Conference on Information Sciences pp 105–
[8] Dubois, Rough fuzzy sets and fuzzy rough sets, International Journal of General Systems 17 pp 191– (1990) · Zbl 0715.04006
[9] Dubois, Intelligent Decision Support, Springer Netherlands pp 203– (1992)
[10] Gong, Rough set theory for the interval-valued fuzzy information systems, Information Sciences 178 pp 1968– (2008) · Zbl 1138.68564
[11] Hu, Information-preserving hybrid data reduction based on fuzzy-rough techniques, Pattern Recognition Letters 27 pp 414– (2006)
[12] Kuncheva, Fuzzy rough sets: Application to feature selection, Fuzzy Sets and Systems 51 pp 147– (1992)
[13] Marczewski, A general scheme of independence in mathematics, Bulletin de L Academie Polonaise des Sciences─║CSerie des Sciences Mathematiques Astronomiques et Physiques 6 pp 731– (1958) · Zbl 0088.03001
[14] Mi, An axiomatic characterization of a fuzzy generalization of rough sets, Information Sciences 160 pp 235– (2004) · Zbl 1041.03038
[15] Nakarnura, Fuzzy rough sets, Note on Multiplevalued Logic in Japan 9 (8) pp 1– (1998)
[16] Nanda, Fuzzy rough sets, Fuzzy Sets and Systems 45 pp 157– (1992) · Zbl 0749.04004
[17] Pawlak, Rough sets, International Journal of Computer and Information Science 11 pp 341– (1982) · Zbl 0501.68053
[18] Thiele, Proc ISMVL-93 pp 62–
[19] Wille, Formal Concept Analysis pp 314– (2009) · Zbl 1247.06004
[20] Wu, Information Systems and Knowledge Discovery (2001)
[21] Xu, Intuitionistic fuzzy information aggregation: Theory and applications (2008)
[22] Yao, Relational interpretations of neighborhood operators and rough set approximation operators, Information Sciences 111 pp 239– (1998) · Zbl 0949.68144
[23] Zhang, Using hybrid monotonic inclusion measure for knowledge reduction in information systems with fuzzy decisions, Chinese Journal of Fuzzy Systems and Mathematics 6 pp 141– (2007) · Zbl 1332.68275
[24] Zhang, Neighborhood operator systems and approximations, Information Sciences 144 pp 201– (2002) · Zbl 1019.68109
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.