面向不一致用户评价准则的在线服务推荐
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Online service recommendation for inconsistent user evaluation criteria
  • 作者:张国涛 ; 付晓东 ; 岳昆 ; 刘骊 ; 冯勇 ; 刘利军
  • 英文作者:ZHANG Guo-tao;FU Xiao-dong;YUE Kun;LIU Li;FENG Yong;LIU Li-jun;Faculty of Information Engineering and Automation,Kunming University of Science and Technology;Faculty of Aeronautics,Kunming University of Science and Technology;School of Information Science and Engineering,Yunnan University;
  • 关键词:在线服务 ; 评价准则 ; 推荐系统 ; 偏好 ; 相似度
  • 英文关键词:online service;;evaluation criterion;;recommendation system;;preference;;similarity
  • 中文刊名:JSJK
  • 英文刊名:Computer Engineering & Science
  • 机构:昆明理工大学信息工程与自动化学院;昆明理工大学航空学院;云南大学信息学院;
  • 出版日期:2019-04-15
  • 出版单位:计算机工程与科学
  • 年:2019
  • 期:v.41;No.292
  • 基金:国家自然科学基金(61462056,61472345,61462051,81560296,61662042);; 云南省应用基础研究计划(2014FA028,2014FA023)
  • 语种:中文;
  • 页:JSJK201904023
  • 页数:9
  • CN:04
  • ISSN:43-1258/TP
  • 分类号:163-171
摘要
客观上,用户的评价准则是由主观意识决定的,用户之间的评价准则不同导致多个用户对同一服务的评分不具备可比较性,不考虑不同用户评分的不可比较性所获得的服务推荐将难以满足用户个性偏好及其真实需求。为此,提出一种面向不一致用户评价准则的在线服务推荐方法,考虑用户偏好不一致时用户对在线服务的偏好关系,以偏好关系计算用户之间的相似度,并以此获得在线服务推荐结果。首先以用户-服务评分矩阵为基础建立用户对服务的偏好关系,其次根据偏好关系计算用户之间的相似度,然后以用户相似度为基础对用户未评分的服务进行评分预测,最后以预测评分的排序结果作为推荐结果。与经典的协同过滤推荐方法的比较实验,验证了本方法的有效性。实验表明,本方法获得的推荐结果能满足大多数用户的服务偏好,同时获得了比经典的协同过滤推荐方法更好的准确率。
        Objectively,user evaluation criteria are determined by subjective consciousness.Different evaluation criteria between users result in that the scores of multiple users for the same service are incomparable.Service recommendations that do not consider the incomparability of different user ratings cannot meet user personal preferences and real needs.Therefore,we propose an online service recommendation method for inconsistent user evaluation criteria.The method calculates online service recommendation results for users by considering the user's preference relationship with the online service when user preferences are inconsistent.Firstly,based on the user-service scoring matrix,the user's preference relationship with the service is established.Secondly,the similarity between users is calculated according to the preference relationship.Thirdly,based on user similarity,the user's unscoring service is scored and predicted.Finally,the ranking results of the predicted scores are used as the recommendation results.In the experiments,we compare the method with the classical collaborative filtering recommendation method to verify its effectiveness.Experimental results show that the recommendation results obtained by the proposed method can meet the service preferences of most users,and at the same time obtain better accuracy than the classic collaborative filtering recommendation method.
引文
[1]Turban E,Lee J K.Electronic commerce 2010-a managerial respective[M].New Jersey:Prentice Hall,2009.
    [2]Yao L,Sheng Q Z,Ngu A H H,et al.Unified collaborative and content-based web service recommendation[J].IEEETransactions on Services Computing,2015,8(3):453-466.
    [3]George G,Haas M R,Pentland A.Big data and management[J].Academy of Management Journal,2014,57(2):321-326.
    [4]Kang G,Liu J,Tang M,et al.An effective web service ranking method via exploring user behavior[J].IEEE Transactions on Network&Service Management,2015,12(4):554-564.
    [5]Arora G,Kumar A,Devre G S,et al.Movie recommendation system based on users’similarity[J].International Journal of Computer Science and Mobile Computing,2014,3(4):765-770.
    [6]Cai Y,Leung H,Li Q,et al.Typicality-based collaborative filtering recommendation[J].IEEE Transactions on Knowledge and Data Engineering,2014,26(3):766-779.
    [7]Kagita V R,Pujari A K,Padmanabhan V.Virtual user approach for group recommender systems using precedence relations[J].Information Sciences,2015,294(C):15-30.
    [8]J sang A,Ismail R,Boyd C.A survey of trust and reputation systems for online service provision[J].Decision Support Systems,2007,43(2):618-644.
    [9]J sang A,Guo G,Pini M S,et al.Combining recommender and reputation systems to produce better online advice[M]∥Modeling Decisions for Artificial Intelligence.Berlin:Springer Berlin Heidelberg,2013:126-138.
    [10]Fu X,Yue K,Liu L,et al.Aggregating ordinal user preferences for effective reputation computation of online services[C]∥Proc of IEEE International Conference on Web Services,2016:554-561.
    [11]Lian Xu-bao,Lin Hong-fei,Xu Bo,et al.Rank-oriented social recommendation algorithm with item tag information[J].Journal of Frontiers of Computer Science and Technology,2017,11(3):373-381.(in Chinese)
    [12]Huang Zhen-hua,Zhang Jia-wen,Tian Chun-qi,et al.Survey on learning-to-rank based recommendation algorithms[J].Journal of Software,2016,27(3):691-713.(in Chinese)
    [13]Ricci F,Rokach L,Shapira B,et al.Recommender systems handbook[M]∥Recommender Systems Handbook.Berlin:Springer,2011:1-35.
    [14]Gao Rong,Li Jing,Du Bo,et al.A synthetic recommendation model for point-of-interest on location-based social networks:Exploiting contextual information and review[J].Journal of Computer Research and Development,2016,53(4):752-763.(in Chinese)
    [15]Liu Jian-xun,Shi Min,Zhou Dong,et al.Topic model based tag recommendation method for Mashups[J].Chinese Journal of Computers,2017,40(2):520-534.(in Chinese)
    [16]Gao Na,Yang Ming.An improved unifying tags and ratings collaborative filtering for recommendation system[J].Jouranl of Nanjing Normal University(Natural Science Edition),2015,38(1):98-103.(in Chinese)
    [17]Wang S,Zheng Z,Wu Z,et al.Reputation measurement and malicious feedback rating prevention in web service recommendation systems[J].IEEE Transactions on Services Computing,2015,8(5):755-767.
    [18]Guo Hong-yi,Liu Gong-shen,Su Bo,et al.Collaborative filtering recommendation algorithm combining community structure and interest clusters[J].Journal of Computer Research and Development,2016,53(8):1664-1672.(in Chinese)
    [19]Hu Y,Peng Q,Hu X,et al.Web service recommendation based on time series forecasting and collaborative filtering[C]∥Proc of IEEE International Conference on Web Services,2015:233-240.
    [20]Gao W,Chen L,Wu J,et al.Joint modeling users,services,mashups,and topics for service recommendation[C]∥Proc of IEEE International Conference on Web Services,2016:260-267.
    [21]Schulze M.A new monotonic,clone-independent,reversal symmetric,and condorcet-consistent single-winner election method[J].Social Choice and Welfare,2011,36(2):267-303.
    [22]Andersen R,Borgs C,Chayes J,et al.Trust-based recommendation systems:An axiomatic approach[C]∥Proc of International Conference on World Wide Web,2008:199-208.
    [23]Qin Ji-wei,Zheng Qing-hua,Tian Feng,et al.Collaborative filtering algorithm integrating trust and preference of user’s emotion[J].Journal of Software,2013,24(Suppl(2)):61-72.(in Chinese)
    [24]Hwang W S,Lee H J,Kim S W.Efficient recommendation methods using category experts for a large dataset[J].Information Fusion,2016,28(C):75-82.
    [25]LüL,Medo M,Chi H Y,et al.Recommender systems[J].Physics Reports,2012,519(1):1-49.
    [26]Zhang Y,Lei T,Wang Y.A service recommendation algorithm based on modeling of implicit demands[C]∥Proc of IEEE International Conference on Web Services,2016:17-24.
    [27]Zhuang H,Savage E M.Variation and Pearson correlation coefficients of Warner-Bratzler shear force measurements within broiler breast fillets[J].Poultry Science,2009,88(1):214-20.
    [28]Hu R,Liu J,Wen Y,et al.USER:A usage-based service recommendation approach[C]∥Proc of IEEE International Conference on Web Services,2016:716-719.
    [11]练绪宝,林鸿飞,徐博,等.融合项目标签信息面向排序的社会化推荐算法[J].计算机科学与探索,2017,11(3):373-381.
    [12]黄震华,张佳雯,田春岐,等.基于排序学习的推荐算法研究综述[J].软件学报,2016,27(3):691-713.
    [14]高榕,李晶,杜博,等.一种融合情景和评论信息的位置社交网络兴趣点推荐模型[J].计算机研究与发展,2016,53(4):752-763.
    [15]刘建勋,石敏,周栋,等.基于主题模型的Mashup标签推荐方法[J].计算机学报,2017,40(2):520-534.
    [16]高娜,杨明.一种改进的结合标签和评分的协同过滤推荐算法[J].南京师大学报(自然科学版),2015,38(1):98-103.
    [18]郭弘毅,刘功申,苏波,等.融合社区结构和兴趣聚类的协同过滤推荐算法[J].计算机研究与发展,2016,53(8):1664-1672.
    [23]秦继伟,郑庆华,田锋,等.一种融合信任和用户情感偏好的协同过滤算法[J].软件学报,2013,24(Supp(2)):61-72.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.