Two kinds of average approximation accuracy  

作　　者：Qingzhao Kong Wanting Wang Dongxiao Zhang Wenbin Zhang 

机构地区：[1]Department of Science,Jimei University,Xiamen,China [2]Digital Fujian Big Data Modeling and Intelligent Computing Institute,Jimei University,Xiamen,China [3]Department of Computer Science,Michigan Technological University,Houghton,Michigan,USA

出　　处：《CAAI Transactions on Intelligence Technology》2024年第2期481-490,共10页智能技术学报（英文）

基　　金：National Natural Science Foundation of China,Grant/Award Number:61976254;Natural Science Foundation of Fujian Province,Grant/Award Numbers:2020J01707,2020J01710。

摘　　要：Rough set theory places great importance on approximation accuracy,which is used to gauge how well a rough set model describes a target concept.However,traditional approximation accuracy has limitations since it varies with changes in the target concept and cannot evaluate the overall descriptive ability of a rough set model.To overcome this,two types of average approximation accuracy that objectively assess a rough set model’s ability to approximate all information granules is proposed.The first is the relative average approximation accuracy,which is based on all sets in the universe and has several basic properties.The second is the absolute average approximation accuracy,which is based on undefinable sets and has yielded significant conclusions.We also explore the relationship between these two types of average approximation accuracy.Finally,the average approximation accuracy has practical applications in addressing missing attribute values in incomplete information tables.

关 键 词：rough sets rough set theory 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]