模式识别与人工智能
Friday, May. 2, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (10): 897-908    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Knowledge Granularity and Relative Granularity Based on Strictly Convex Function
HUANG Guo-Shun1 , ZENG Fan-Zhi2 , CHEN Guang-Yi3 , WEN Han1
1 .Science School, Foshan University, Foshan 528000
2 .Electronics and Information Engineering School, Foshan University, Foshan 528000
3Mechatronics and Electronic Engineering School, Foshan University, Foshan 528000

Download: PDF (458 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The strictly convex function is introduced into the research of knowledge granularity for the first time. Based on the strictly convex function, a theory framework for constructing knowledge granularity is proposed. A series of knowledge granularity measuring functions is derived under this framework. It is proved that the existing knowledge granularity measuring functions are the special cases or variations of knowledge granularity measures which are derived by strictly convex functions. The definition of the relative knowledge granularity based on strictly convex function is given. Its monotonicity is proved for some special strictly convex functions and the corresponding equality conditions are provided, although it does not hold for general strictly convex functions. It is proved that the existing two conditional information entropies are the special forms of the proposed relative knowledge granularity. Their knowledge granularity essence is revealed. For a consistent decision table, it is proved that the relative knowledge granularity is equivalent to positive region for each other. Therefore, the attribute reduction judgment method of algebraic reduction is presented by the relative granularity in consistent decision table. The correctness of the proposed conclusions is showed by a numerical example.
Key wordsStrictly Convex Function      Knowledge Granularity      Relative Granularity      Conditional Information Entropy     
Received: 20 June 2012     
ZTFLH: TP181  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
HUANG Guo-Shun
ZENG Fan-Zhi
CHEN Guang-Yi
WEN Han
Cite this article:   
HUANG Guo-Shun,ZENG Fan-Zhi,CHEN Guang-Yi等. Knowledge Granularity and Relative Granularity Based on Strictly Convex Function[J]. , 2013, 26(10): 897-908.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2013/V26/I10/897
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn