원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
vol.3 no.2
2010.06
pp.4-60
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information system. The existing reduct approaches under soft set theory are still based on Boolean-valued information system. However, in the real applications, the data usually contain non-Boolean values. In this paper, an alternative approach for attribute reduction in multi-valued information system under soft set theory is presented. Based on the notion of multi-soft sets and AND operation, attribute reduction can be defined. It is shown that the reducts obtained are equivalent with Pawlak’s rough reduction.
목차
Abstract
1. Introduction
2. Related Works
3. Information Systems and Set Approximations
4. Soft Set Theory
5. Reduct in Information Systems using Soft Set Theory
5.1 Multi-soft sets construction from multi-information systems
5.2 AND and OR operations in multi-soft sets
5.3 Attribute reduction
6. Conclusion
References
1. Introduction
2. Related Works
3. Information Systems and Set Approximations
4. Soft Set Theory
5. Reduct in Information Systems using Soft Set Theory
5.1 Multi-soft sets construction from multi-information systems
5.2 AND and OR operations in multi-soft sets
5.3 Attribute reduction
6. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보