earticle

논문검색

A New Symbolic Method for Discernibility Matrix in Rough Set

초록

영어

Generating discernibility matrix consumes huge time and space .To solve this problem, A new Binary Discernibility Matrix (BDM) induced from information table is defined, The concept of Binary Conjunction Matrix(BCM) is then introduced, Finally A novel method for discernibility matrix using Zero-Suppressed BDDs (ZBDD) and Ordered binary decision diagrams (OBDD) is proposed in this paper, experiment is carried to compare the storage space of discernibility matrix with that of ZBDD and OBDD, results show that the new method has better storage performance and improve the attribute reduction for those information systems with more objects and features.

목차

Abstract
 1. Introduction
 2. Indiscernibility Relation in Rough Sets Theory
  2.1. Information Systems for Rough Set
  2.2. Indiscernibility Relation and Set Approximation
  2.3. Reduct of Rough Set Theory and Independence of Attributes
  2.4. Definition. Discernibility Matrix
 3. OBDD and Zero-suppressed BDDS
  3.1. Ordered Binary Decision Diagram
  3.2. Combination Sets
  3.3. Zero-suppressed BDDs
 4. Ordered Binary Decision Diagram Discernibility Matrix
  4.1. BDM and BCM
  4.2. Order Binary Decision Diagram Discernibility Matrix
 5. ZBDDs Discernibility Matrix
 6. Experiments and Conclusions
  6.1. Experimental Results
  6.2. Conclusion
 Acknowledgements
 References

저자정보

  • Qianjin Wei School of Electronic Engineering, XiDian University, Xi, an, 710071.China
  • Tianlong Gu School of Electronic Engineering, XiDian University, Xi, an, 710071.China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.