检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Li Huaxiong Zhou Xianzhong Huang Bing
机构地区:[1]School of Management and Engineering, Nanjing Univ., Nanjing 210093, P. R. China [2]State Key Lab. for Novel Software Technology, Nanjing Univ., Nanjing 210093, P. R. China [3]School of Information Science, Nanjing Audit Univ., Nanjing 210029, P. R. China
出 处:《Journal of Systems Engineering and Electronics》2009年第1期98-105,共8页系统工程与电子技术(英文版)
基 金:supported by the National Natural Science Foundation of China (70571032)
摘 要:An improvement of tolerance relation is proposed in regard to rough set model based on connection degree by which reflexivity of relation can be assured without loss of information. Then, a method to determine optimal identity degree based on relative positive region is proposed so that the identity degree can be computed in an objective method without any preliminary or additional information about data, which is consistent with the notion of objectivity in rough set theory and data mining theory. Subsequently, an algorithm is proposed, and in two examples, the global optimum identity degree is found out. Finally, in regard to optimum connection degree, the method of rules extraction for connection degree rough set model based on generalization function is presented by which the rules extracted from a decision table are enumerated.An improvement of tolerance relation is proposed in regard to rough set model based on connection degree by which reflexivity of relation can be assured without loss of information. Then, a method to determine optimal identity degree based on relative positive region is proposed so that the identity degree can be computed in an objective method without any preliminary or additional information about data, which is consistent with the notion of objectivity in rough set theory and data mining theory. Subsequently, an algorithm is proposed, and in two examples, the global optimum identity degree is found out. Finally, in regard to optimum connection degree, the method of rules extraction for connection degree rough set model based on generalization function is presented by which the rules extracted from a decision table are enumerated.
关 键 词:rough set data mining connection degree identity degree set pair relative positive region.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.108.240