模式识别与人工智能
Tuesday, Jul. 29, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2019, Vol. 32 Issue (8): 699-708    DOI: 10.16451/j.cnki.issn1003-6059.201908003
Granular Computing Theory and Application Research Current Issue| Next Issue| Archive| Adv Search |
Distinguishability and Attribute Reduction for Entire-Granulation Rough Sets
YAO Kun1, DENG Dayong1,2, WU Yue1
1.College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua 321004
2.Xingzhi College, Zhejiang Normal University, Jinhua 321004

Download: PDF (680 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  

It is difficult to calculate attribute reduct due to high time and space complexity of entire-granulation rough sets. To solve this problem, distinguishability in information systems is defined by equivalent class, and its properties are studied. It is proved that the attribute reduct based on distinguishability is equivalent to absolute reduct. The positive region distinguishability in decision systems is defined and its properties are discussed. It is also proved that positive region distinguishability reduct is a superset of entire-granulation Pawlak reduct, but in most cases it is equal to entire-granulation Pawlak reduct and it can be regarded as an approximation of entire-granulation Pawlak reduct. Theoretical analysis and experiments show that compared with other attribute reduction algorithms, positive region distinguishability reduct has great advantages in computational complexity and classification accuracy.

Key wordsEntire-Granulation Rough Sets      Distinguishability      Attribute Reduction      Positive Region Distinguishability      Entire-Granulation Pawlak Reduct     
Received: 04 March 2019     
ZTFLH: TP 18  
Fund:

Supported by Zhejiang Normal University: A Top Discipline of Cyberspace Security in Zhejiang Province

Corresponding Authors: DENG Dayong(Corresponding author), Ph.D., associate professor. His research interests include rough sets, granular computing and data mining.   
About author:: YAO Kun, master student. His research interests include rough sets.WU Yue, master student. His research interests include rough sets.
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
YAO Kun
DENG Dayong
WU Yue
Cite this article:   
YAO Kun,DENG Dayong,WU Yue. Distinguishability and Attribute Reduction for Entire-Granulation Rough Sets[J]. , 2019, 32(8): 699-708.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.201908003      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2019/V32/I8/699
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