期刊文献+

面向不完整序数偏好的在线服务评价 被引量:1

Online service evaluation for incomplete ordinal preferences
下载PDF
导出
摘要 为解决在不完整序数偏好场景下的在线服务评价问题,提出一种面向不完整序数偏好的在线服务评价方法。首先,通过定义面向不完整序数偏好的Kendall tau胜者距离,将其作为服务评价指标,实现了在不完整序数偏好场景下的在线服务评价;然后,设计了用于评估和优化服务评价结果质量的评估算法与偏好抽取策略,用于在需要时对服务评价结果质量进行评估,并向用户进行少量但关键的偏好查询,以实现快速优化服务评价结果质量;最后,基于真实数据集与人工合成数据集的实验结果验证了该方法的合理性和有效性。 To solve the problem of online service evaluation in incomplete ordinal preference scenarios,an online service evaluation method for incomplete ordinal preference was proposed.Kendall tau winner distance for incomplete ordinal preference was defined as a service evaluation indicator to implements online service evaluation in incomplete ordinal preference.An evaluation algorithm and preference elicitation strategy for evaluating and optimizing the quality of service evaluation results were designed to evaluate and optimize the quality of service evaluation results when needed.By executing a few but critical preference queries to users,the quality of evaluation results could be quickly improved.The experimental results based on real data sets and artificially synthesized data sets verified the rationality and effectiveness of the proposed method.
作者 付晓东 彭俊 岳昆 刘骊 刘利军 冯勇 FU Xiaodong;PENG Jun;YUE Kun;LIU Li;LIU Lijun;FENG Yong(Yunnan Provincial Key Laboratory of Computer Technology Application, Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China;School of Information Science and Engineering, Yunnan University, Kunming 650091, China)
出处 《计算机集成制造系统》 EI CSCD 北大核心 2021年第10期2774-2785,共12页 Computer Integrated Manufacturing Systems
基金 国家自然科学基金资助项目(61962030,61862036,U1802271,61860318) 云南省中青年学术和技术带头人后备人才项目(202005AC160036) 云南省基础研究计划杰出青年资助项目(2019FJ011)。
关键词 在线服务评价 不完整序数偏好 Kendall tau胜者距离 偏好抽取 服务排序 online service evaluation incomplete ordinal preference Kendall tau winner distance preference elicitation service ranking
  • 相关文献

参考文献6

二级参考文献52

  • 1宋光兴,杨德礼.电子商务中在线信誉管理系统设计的若干问题研究[J].系统工程,2004,22(9):5-9. 被引量:46
  • 2张成文,苏森,陈俊亮.基于遗传算法的QoS感知的Web服务选择[J].计算机学报,2006,29(7):1029-1037. 被引量:103
  • 3许斌,李涓子,王克宏.Web服务语义标注方法[J].清华大学学报(自然科学版),2006,46(10):1784-1787. 被引量:23
  • 4Boutilier C, Brafman R I, Domshlak C, Hoos H H, Poole D. CP net : A tool for representing and reasoning with condi tional ceteris paribus preference statements, Journal of Arti- ficial Intelligence Research, 2004, 21(1): 135-191.
  • 5Goldsmith J, Lang J, Truszczynski M, Wilson N. The corn putational complexity of dominance and consistency in CP nets. Journal of Artificial Intelligence Research, 2008 33(1) : 403 432.
  • 6Domshlak C, Rossi F, Venable B K, Walsh T. Reasoning about soft constraints and conditional preferences: Complexity results and approximation teehniques//Proceedings of the 18th International Joint Cont'erence on Artificial Intelligence. Acapuleo, Mexico, 2003:215-220.
  • 7Domshlak C, Brafman R I. CP-nets reasoning and consisten cy testing//Proceedings of the Eighth International Confer ence on Principles of Knowledge Representation and Reason ing. Toulouse, France, 2002:121-132.
  • 8Benthem J, Girard P, Roy O. Everything else being equal: A modal logic for ceteris paribus preferences. Journal of Phil- osophlcal Logic, 2008, 88(1): 83-125.
  • 9Doyle J, Wellman M P. Representing preferences as ceteris paribus comparatives//Proceedings of the Working Notes of the AAAI Spring Symposium on Decision Theoretic Plan ning. 1994:69-75.
  • 10Ardagna D, Pernici B. Adaptive service composition in flexi- ble processes. IEEE Transactions on Software Engineering, P.O07, 33(6): 369 384.

共引文献96

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部