检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭蔚 吴茂念[1,2] 郝秀兰 朱绍军[1,2] 郑博 Peng Wei;Wu Maonian;Hao Xiulan;Zhu Shaojun;Zheng Bo(School of Information Engineering,Huzhou University,Huzhou 313000,Zhejiang,China;Zhejiang Province Key Laboratory of Smart Management&Application of Modern Agricultural Resources,Huzhou 313000,Zhejiang,China)
机构地区:[1]湖州师范学院信息工程学院,浙江湖州313000 [2]浙江省现代农业资源智慧管理与应用研究重点实验室,浙江湖州313000
出 处:《计算机应用与软件》2024年第2期286-292,310,共8页Computer Applications and Software
基 金:国家自然科学基金项目(61906066);浙江省教育厅专业学位研究生培养模式改革项目(Y202044192)。
摘 要:针对本体逻辑冲突消除传统方法未充分利用本体逻辑性质的缺陷,引入Shapley值法刻画本体逻辑性质,构建基于多目标0-1整数线性规划的本体冲突消除方法,使用分层序列法求解多目标线性规划模型。其解遵循理性放弃原则,避免传统方法中目标权重的平均性或随机性。实验结果表明,采用该方法能够令解集遵循理性放弃原则的前提下,利用本体逻辑性质有效减少解集数量,从而提高决策效率。To recover the defect that the traditional method of ontology logic conflict elimination failed to fully utilize the logical properties of the ontology,a new method based on multi-objective 0-1 integer linear programming was proposed which introduced the Shapley value to depict the logic properties of ontology.To avoid the equilibrium or randomness of object weights in traditional methods,the hierarchical sequence algorithm was used to solve the multi-objective linear programming model,and its solution followed the principle of rational abandonment.The experimental results show that this algorithm can effectively reduce the number of solution sets and improve the decision-making efficiency by utilizing the logic property of ontology in the context that the solution set follows the principle of rational abandonment.
关 键 词:本体 逻辑冲突 多目标整数线性规划 最小不可满足子集 SHAPLEY值法
分 类 号:TP3[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.191.28.161