Invariant Characters of Tolerance Class and Reduction under Homomorphism in IIS
Authors: Chen Wu, Lijuan Wang
Abstract:
Some invariant properties of incomplete information systems homomorphism are studied in this paper. Demand conditions of tolerance class, attribute reduction, indispensable attribute and dispensable attribute being invariant under homomorphism in incomplete information system are revealed and discussed. The existing condition of endohomomorphism on an incomplete information system is also explored. It establishes some theoretical foundations for further investigations on incomplete information systems in rough set theory, like in information systems.
Keywords: Attribute reduction, homomorphism, incomplete information system, rough set, tolerance relation.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1315495
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 749References:
[1] Chen Wanli, Cheng J X, Zhang C J. “A Generalized Model of Rough Set Theory Based on Compatibility Relation”, Journal of computer engineering and applications, 16(4), 2004, page 26-28.
[2] Grzymala-Busse J W. “Algebraic properties of knowledge representation systems”. In: Proc. of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, Knoxville, 1986, page 432-440.
[3] Grzymala-Busse J W, Sedelow W A Jr. “On rough sets, and information system homomorphisms”. Bulletin of the Polish Academy of Sciences Technical Sciences, 36(3-4) 1988, page 233-239.
[4] Kryszkiewicz M. “Rough Set Approach to Incomplete Information Systems”, Information Sciences, 12(1-4), 1998, page 39-49.
[5] Leung J Y, Li D Y. “Maximal consistent block technique for rule acquisition in incomplete information systems”, Information Sciences, 153, 2003, page 86-106.
[6] Li Deyu, Ma Yicheng. “Invariant characters of information systems under some homomorphism”. Information Sciences: An International Journal, 129(1-4), 2000, page 211-220.
[7] Pawlak Z. “Rough sets”. International Journal of Computer and Information Sciences, 11(5) 1982, page 341-356.
[8] Pawlak Z. “Rough Sets-Theoretical Aspects of Reasoning about Data”. Dordecht: Kluwer Academic Publishers. 1991, page 67-86.
[9] Qian Yu. Hua, Liang Jiye, Yao Yiyu. “MGRS: A multi-granulation rough set”, Information Sciences, 180(6), 2010, page 949–970.
[10] Qian Yu. Hua, Liang Jiye. “Incomplete multi-granulation rough set”, IEEE Transactions on Systems, Man and Cybernetics, Part A, 40(2), 2010, page 420-431.
[11] Qian Yu. Hua, Liang Jiye. “Pessimistic rough decision”, in: Second International Workshop on Rough Sets Theory, Zhoushan, China, 2010, page 440–449.
[12] Qu Kaishe, Zhai Yanhui, Li Deyu, Liang Jiye. “Some characters of information system homomorphism and invariance of upper and lower approximations”. Computer Sciences, 32(12), 2005, page 168-174.
[13] Stefanowski J. “Incomplete Information Tables and Rough Classification”, Journal of Computational Intelligence, 17(3), 2001, page 545-566.
[14] Wang Changzhong, Chen Degang, Hu Qinghua. “Some invariant properties of ordered information systems under homomorphism”. Science China-Information Sciences, 53(9), 2010, page 1816-1825.
[15] Wang G Y, Lu M Y. “Variable precision rough set based decision tree classifier”, Journal of Intelligent and Fuzzy Systems, 23(2-3), 2012, page 61-70.
[16] Wang Lijuan, Yang Xibei, Yang Jingyu, Wu Chen. “Incomplete Decision Rule Acquisition Based on Multi-granulation Theory”, Journal of Nanjing University of Science and Technology, 37(1), 2013, page 12-18.
[17] Wu C, Yang X B. “Information Granules in General and Complete Covering”, Proceedings of the 2005 IEEE International Conference on Granular Computing, 2005, page 675-678.
[18] Zhai Yanhui, Qu Kaishe. “On characteristics of information system homomorphism”. Theory of Computing Systems, 44(3), 2009, page 414–431.
[19] Zhang Wenxiu, Mi Jusheng, Wu Weizhi. “Knowledge Reductions in Inconsistent Information Systems”, Chinese Journal of Computers (in Chinese), 1(1), 2003, page 12-18.