微信服务号

微信订阅号

2025-4-24- 14
Home > Archive>Volume 21, Issue 11, 2010 >2782-2789
PDF HTML XML Export Cite reminder
Covering Model of Granular Computing
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [21]
    • |
  • Related [20]
    • |
  • Cited by
    • | |
  • 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
    [1] Zadeh LA, Wrote; Ruan D, Huang CF, Trans. Fuzzy Sets and Fuzzy Information Granulation Theory. Beijing: Beijing Normal University, 2000 (in Chinese).
    [2] Pawlak Z. Rough sets. Int’l Journal of Computer and Information Science, 1982,11(5):341?356. [doi: 10.1007/BF01001956]
    [3] Zadeh LA. Fuzzy sets. Information Control, 1965,8(3):338?353. [doi: 10.1016/S0019-9958(65)90241-X]
    [4] Yao YY. Granular computing for data mining. In: Dasarathy BV, ed. Proc. of the SPIE Conf. on Data Mining, Intrusion Detection, Information Assurance, and Data Networks Security. 2006. 1?12.
    [5] Hobbs JR. Granularity. In: Proc. of the IJCAI. 1985. 432?435.
    [6] Zadeh LA. Fuzzy logic-computing with words. IEEE Trans. on Fuzzy Systems, 1996,4(2):103?111. [doi: 10.1109/91.493904]
    [7] Zadeh LA. Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 1997,90(2):111?127.
    [8] Zhang L, Zhang B. The quotient space theory of problem solving. Fundamenta Informaticae, 2004,59(2-3):287?298.
    [9] Lin TY. Granular computing on binary relations I: Data mining and neighborhood systems. In: Skowron A, Polkowski L, eds. Rough Sets in Knowledge Discovery. Heidelberg: Physica-Verlag, 1998. 107?121.
    [10] Lin TY. Granular computing on binary relations II: Rough set representations and belief functions. In: Skowron A, Polkowski L, eds. Rough Sets in Knowledge Discovery. Heidelberg: Physica-Verlag, 1998. 121?140.
    [11] Ma JM, Zhang WX, Li TJ. A covering model of granular computing. In: Proc. of the 2005 Int’l Conf. in Machine Learning and Cybernetics. 2005. 1625?1630.
    [12] Wang GY, Hu F, Huang H, Wu Y. A granular computing model based on tolerance relation. The Journal of China Universities of Posts and Telecommunications, 2005,12(3):86?90.
    [13] Miao DQ, Wang GY, Liu Q, Lin TY, Yao YY. Granular Computing: Past, Present and the Future. Beijing: Science Press, 2007 (in Chinese).
    [14] Yao YY. A partition model of granular computing. Lecture Notes in Computer Science, 2004,3100:232?253.
    [15] Ma JM, Zhang WX, Leung Y, Song XX. Granular computing and dual Galois connection. Information Sciences, 2007,177(23): 5365?5377. [doi: 10.1016/j.ins.2007.07.008]
    [16] Zhu W. Generalized rough sets based on relations. Information Sciences, 2007,177(22):4997?5011. [doi: 10.1016/j.ins.2007.05. 037]
    [17] Bonikowski Z, Bryniarski E, Wybraniec-Skardowska U. Extensions and intentions in the rough set theory. Journal of Information Sciences, 1998,107:149?167. [doi: 10.1016/S0020-0255(97)10046-9]
    [18] Qian YH, Liang JY, Dang CY. Knowledge structure, knowledge granulation and knowledge distance in a knowledge base. Int’l Journal of Approximate Reasoning, 2009,50(1):174?188.
    [19] Jarvinen J, Kondo M, Kortelainen J. Logic from Galois connections. Int’l Journal of Approximate Reasoning, 2008,49(3):595?606. [doi: 10.1016/j.ijar.2008.06.003]
    附中文参考文献: [1] Zadeh L,著;阮达,黄崇福,译.模糊集与模糊信息粒理论.北京:北京师范大学出版社,2000.
    [13] 苗夺谦,王国胤,刘清,林早阳,姚一豫.粒计算:过去、现在与展望.北京:科学出版社,2007.
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:5251
  • PDF: 5822
  • HTML: 0
  • Cited by: 0
History
  • Received:March 09,2009
  • Revised:June 01,2009
Links:Institute of Software, CASChina Computer FederationCASNSFC
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