earticle

논문검색

Reduction Algorithm for Decision Table Combined with Grey Relational Analysis

초록

영어

The fuzziness and randomness of decision table affect hugely on the performance of knowledge acquisition in rough set. In order to reduce their influence, a novel reduction algorithm based on grey relational analysis is proposed. In the algorithm, every value of decision table is converted to the same domain. Moreover, on the basis of grey relational analysis, the grey relational matrix for the converted decision table is constructed to describe the equivalence relations between samples of decision table. Finally, the samples with the same similar level are adopted as the coarser granularity. The experiments fully show that the reduction decision table achieved almost the same recognition rate with less than one tenth of the former conditions. It fully shows the effectiveness of the algorithm.

목차

Abstract
 1. Introduction
 2. Fundamental Concepts
  2.1. Reduction Decision Table in Rough Set
  2.2. Grey Relational Analysis
 3. Reduction Algorithm for Decision Table based on Grey Relational Analysis
 4. Experiment and Analysis
 6. Conclusions
 Acknowledgements
 References

저자정보

  • Jin Dai School of Software Engineering, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P. R. China
  • Xin Liu School of Software Engineering, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P. R. China
  • Feng Hu College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P. R. China

참고문헌

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

    함께 이용한 논문

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

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