Matrix Computation for Optimal Approximation Rough Set
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

TP18

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The upper and lower approximation sets of rough sets derived from approximate space are the core foundation of the rough set theory and its applied research. However, this description only gives a range of rough sets. To depict the target concept and promote rough set application more accurately, this paper, according to the computation problem of the optimal approximate set of rough sets, proposed a calculation method based on matrixes. Then, some concepts such as Boolean matrix, relation matrix, set matrix and similarity degree matrix were introduced. By discussing the similarity degree between the target concept and its approximate set, some relevant rules were obtained. A new judgment and algorithm of optimal approximate set based on matrix for rough set was eventually established. Finally, a practical example was given to further illustrate results above.

    Reference
    Related
    Cited by
Get Citation

罗来鹏,刘二根,范自柱.最优近似粗糙集的矩阵计算[J].华东交通大学学报英文版,2018,35(4):83-88.
Luo Laipeng, Liu Ergen, Fan Zizhu. Matrix Computation for Optimal Approximation Rough Set[J]. JOURNAL OF EAST CHINA JIAOTONG UNIVERSTTY,2018,35(4):83-88

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online: May 26,2021
  • Published:
Article QR Code