Please wait a minute...
 首页  期刊介绍 期刊订阅 联系我们 横山亮次奖 百年刊庆
 
最新录用  |  预出版  |  当期目录  |  过刊浏览  |  阅读排行  |  下载排行  |  引用排行  |  横山亮次奖  |  百年刊庆
清华大学学报(自然科学版)  2018, Vol. 58 Issue (8): 715-724    DOI: 10.16511/j.cnki.qhdxxb.2018.21.018
  计算机科学与技术 本期目录 | 过刊浏览 | 高级检索 |
基于排序对社会选择函数的在线服务评价
付晓东1,2, 李俊1, 刘骊1, 岳昆3, 冯勇1, 刘利军1
1. 昆明理工大学 信息工程与自动化学院, 云南省计算机技术应用重点实验室, 昆明 650500;
2. 昆明理工大学 航空学院, 昆明 650500;
3. 云南大学信息学院, 昆明 650091
Evaluating online services based on a ranked pairs social choice function
FU Xiaodong1,2, LI Jun1, LIU Li1, YUE Kun3, FENG Yong1, LIU Lijun1
1. Yunnan Provincial Key Laboratory of Computer Technology Application, Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China;
2. Faculty of Aeronautics, Kunming University of Science and Technology, Kunming 650500, China;
3. School of Information Science and Engineering, Yunnan University, Kunming 650091, China
全文: PDF(1312 KB)  
输出: BibTeX | EndNote (RIS)      
摘要 不同用户具有不同的评价准则,导致不同用户对同一在线服务的评分不具可比性,使聚合服务评分得到的在线服务评价结果难以真实反映服务之间的优劣关系。为此,该文提出一种基于排序对(ranked pairs)社会选择函数的在线服务评价方法,根据用户对在线服务的偏好关系而不是传统评分计算在线服务评价结果。首先根据用户-服务评分矩阵获得每个用户对在线服务的偏好关系;然后基于多数准则确定服务优先关系,并根据服务优先关系建立服务对排序列表;最后构造以服务为节点的有向无环图,并在该有向无环图中寻找一条包含所有服务的路径,根据该路径的服务排序计算在线服务评价值。理论分析和实验结果验证了该方法的合理性和有效性。
服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
付晓东
李俊
刘骊
岳昆
冯勇
刘利军
关键词 在线服务评价不可比较评分排序对服务排序    
Abstract:Different customers may have different evaluation criteria which leads to different ratings of online services. Thus, aggregation of the ratings cannot objectively evaluate the services. This paper presents an online services evaluation method based on a ranked pairs social choice function. The method uses preference relations rather than ratings to evaluate the online services. First, the preference relations of the customer are calculated based on a ratings matrix. Then, a list of online service pairs is established according to the service priority relationship determined from the majority rule. Finally, a directed acyclic graph is constructed and a path is found in the graph that contains all the online services. The service order in the path is then used to evaluate the services. A theoretical analysis and tests verify the reasonability and effectiveness of this method.
Key wordsonline services evaluation    incomparable ratings    ranked pairs    service ranking
收稿日期: 2018-04-08      出版日期: 2018-08-15
基金资助:国家自然科学基金地区项目(61462056,61462051,81560296,61662042);国家自然科学基金面上项目(61472345);云南省应用基础研究计划项目(2014FA028)
引用本文:   
付晓东, 李俊, 刘骊, 岳昆, 冯勇, 刘利军. 基于排序对社会选择函数的在线服务评价[J]. 清华大学学报(自然科学版), 2018, 58(8): 715-724.
FU Xiaodong, LI Jun, LIU Li, YUE Kun, FENG Yong, LIU Lijun. Evaluating online services based on a ranked pairs social choice function. Journal of Tsinghua University(Science and Technology), 2018, 58(8): 715-724.
链接本文:  
http://jst.tsinghuajournals.com/CN/10.16511/j.cnki.qhdxxb.2018.21.018  或          http://jst.tsinghuajournals.com/CN/Y2018/V58/I8/715
  图1 算法1
  图2 算法2
  图3 算法3
  图4 算法4
  图5 孔多赛性验证
  图6 反转对称性验证
  图7 多数准则验证
  图8 单调性验证
  图9 操纵复杂性验证
  图10 运行时间
[1] KRAUSE A, HORVITZ E. A utility-theoretic approach to privacy in online services[J]. Journal of Artificial Intelligence Research, 2014, 39(1):633-662.
[2] 王尚广, 孙其博, 杨放春. Web服务选择中信誉度评估方法[J]. 软件学报, 2012, 23(6):1350-1367.WANG S G, SUN Q B, YANG F C. Reputation evaluation approach in Web service selection[J]. Journal of Software, 2012, 23(6):1350-1367.(in Chinese)
[3] 蒋哲远, 韩江洪, 王钊. 动态的QoS感知Web服务选择和组合优化模型[J]. 计算机学报, 2009, 32(5):1014-1025.JIANG Z Y, HAN J H, WANG Z. An optimization model for dynamic QoS-aware Web services selection and composition[J]. Chinese Journal of Computers, 2009, 32(5):1014-1025. (in Chinese)
[4] BHARGAVA K, GUJRAL T, CHAWLA M, et al. Comment based seller trust model for E-commerce[C]//Proceedings of 2016 International Conference on Computational Techniques in Information and Communication Technologies. New Delhi, India:IEEE, 2016:387-391.
[5] ZHANG X Z, CUI L S, WANG Y. Computing multi-dimensional trust by mining E-commerce feedback comments[J]. IEEE Transactions on Knowledge & Data Engineering, 2014, 26(7):1631-1643.
[6] YAO Y, RUOHOMAA S, XU F. Addressing common vulnerabilities of reputation systems for electronic commerce[J]. Journal of Theoretical & Applied Electronic Commerce Research, 2012, 7(1):1-20.
[7] FU X D, YUE K, LIU L, et al. Aggregating ordinal user preferences for effective reputation computation of online services[C]//Proceedings of 2016 IEEE International Conference on Web Services. San Francisco, USA:IEEE, 2016:554-561.
[8] 付晓东, 邹平, 姜瑛. 基于质量相似度的Web服务信誉度量[J]. 计算机集成制造系统, 2008, 14(3):619-624.FU X D, ZOU P, JIANG Y. Web service reputation measurement based on quality of service similarity[J]. Computer Integrated Manufacturing Systems, 2008, 14(3):619-624. (in Chinese)
[9] DEY P, MISRA N, NARAHARI Y. Kernelization complexity of possible winner and coalitional manipulation problems in voting[J]. Theoretical Computer Science,2016, 616(1):111-125.
[10] MCAULEY J, LESKOVEC J, JURAFSKY D. Learning attitudes and attributes from multi-aspect reviews[Z/OL]. (2012-11-31). https://arxiv.org/abs/1210.3926.
[11] HSIEH H Y, WU S H. Ranking online customer reviews with the SVR model[C]//Proceedings of 2015 IEEE International Conference on Information Reuse and Integration. San Francisco, USA:IEEE, 2015:550-555.
[12] SCAFFIDI C, BIERHOFF K, CHANG E, et al. Red Opal:Product-feature scoring from reviews[C]//Proceedings of the 8th ACM Conference on Electronic Commerce. San Diego, USA:ACM, 2007:182-191.
[13] 吕品, 钟珞, 唐琨皓. 在线产品评论用户满意度综合评价研究[J]. 电子学报, 2014, 42(4):740-746.LÜ P, ZHONG L, TANG K H. Customer satisfaction degree evaluation of online product review[J]. Acta Electronica Sinica, 2014, 42(4):740-746. (in Chinese)
[14] 王玉祥, 乔秀全, 李晓峰,等. 上下文感知的移动社交网络服务选择机制研究[J].计算机学报, 2010, 33(11):2126-2135.WANG Y X, QIAO X Q, LI X F, et al. Research on context-awareness mobile SNS service selection mechanism[J]. Chinese Journal of Computers, 2010, 33(11):2126-2135. (in Chinese)
[15] JOSANG A, ISMAIL R. The beta reputation system[C/OL].[2017-06-01]. http://aisel.aisnet.org/bled2002/41/.
[16] ARROW K J. Social choice and individual values[M]. New Haven, USA:Yale university press, 2012.
[17] DAVID H A. The method of paired comparisons[M]. 2nd ed. London, UK:Hodder Arnold, 1988.
[18] OKASHA S. Theory choice and social choice:Kuhn versus Arrow[J]. Mind, 2011, 120(477):83-115.
[19] TIDEMAN T N. Independence of clones as a criterion for voting rules[J]. Social Choice and Welfare, 1987, 4(3):185-206.
[20] VIGLAS S D. Rate-based query optimization for streaming information sources[C]//Proceedings of 2002 ACM SIGMOD International Conference on Management of Data. Madison, USA:ACM, 2002:37-48.
[21] 张莉, 张斌, 黄利萍,等. 基于服务调用特征模式的个性化Web服务QoS预测方法[J]. 计算机研究与发展, 2013, 50(5):1066-1075.ZHANG L, ZHANG B, HUANG L P, et al. A personalized Web service quality prediction approach based on invoked feature model[J]. Journal of Computer Research & Development, 2013, 50(5):1066-1075. (in Chinese)
[22] ZHAO T, MCAULEY J, KING I. Leveraging social connections to improve personalized ranking for collaborative filtering[C]//Proceedings of the 23rd ACM International Conference on Conference on Information & Knowledge Management. Shanghai, China:ACM, 2014:261-270.
[23] HARPER F M, KONSTAN J A. The MovieLens datasets:History and context[J]. ACM Transactions on Interactive Intelligent Systems, 2015, 5(4):19.
[24] FANG W D, ZHANG C L, SHI Z D, et al. BTRES:Beta-based trust and reputation evaluation system for wireless sensor networks[J]. Journal of Network & Computer Applications, 2016, 59:88-94.
[25] HERINGS P J J, HOUBA H. The Condorcet paradox revisited[J]. Social Choice and Welfare, 2016, 47(1):141-186.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 《清华大学学报(自然科学版)》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn