关键词: 不完备序信息系统, 证据特征, 属性约简, 信任约简, 似然约简

Abstract: The incomplete ordered information system extends the model of classic rough set theory. Instead of applying equivalence relationship, it has better performance on the data with unknown attribute values or preferred relationship by applying the dominance relationship. Based on the research on the features of incomplete ordered information system, a pair of upper and lower operators are given, while their relationship with likelihood function and belief function are also elaborated. Moreover, the definitions of[R]reduction, belief reduction and plausible reduction are given on the incomplete ordered information system respectively. This paper proves that a [R] reduction is equivalent with the belief reduction, which are both the minimum attribute set to keep the belief function, and the conclusion is that a plausibility consistent set must be a [R] consistent set.

Key words: incomplete ordered information system, evidence characteristic, attribute reduction, belief reduction, plausible reduction