检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张倩生[1] 周作领[2] 许绍元[1] 贾保果[1] 罗俊[1]
机构地区:[1]中山大学数学与计算科学学院 [2]中山大学岭南学院,广州510275
出 处:《计算机科学》2003年第6期133-135,共3页Computer Science
基 金:国家自然科学基金(10171116);教育部博士点基金(1999055810);广东省自然科学基金(011221)资助
摘 要:This paper proposes a new method of constructing generahzed concept lattice and producing rules from it in the generalized rough approximate space based on generalized similar relation which is more extensive than equivalent relation. Finally, a simple algorithm is presented to extract rules based on interesting measure.This paper proposes a new method of constructing generalized concept lattice and producing rules from it in the generalized rough approximate space based on generalized similar relation which is more extensive than equivalent relation. Finally, a simple algorithm is presented to extract rules based on interesting measure.
关 键 词:粗集理论 广义概念格 广义粗近似空间 规则提取 人工智能
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63