Covering Model of Granular Computing
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    To investigate the basic problems of granular computing, such as granulation, computing with granulars and so on, in a more general setting, a covering model of granular computing is introduced in this paper by relaxing the three conditions of equivalence relations, which generalizes the existing models. Under this model, Zoom-in and Zoom-out operators are defined, respectively. Different combinations of Zoom-in and Zoom-out operators form different rough approximations of the universe of discourse and granulated universe of discourse. This paper studies their propertis and establishes their relationship with topological space and Galois connection.

    Reference
    Related
    Cited by
Get Citation

折延宏,王国俊.粒计算的一种覆盖模型.软件学报,2010,21(11):2782-2789

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:March 09,2009
  • Revised:June 01,2009
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063