基于信任扩展和列表级排序学习的服务推荐方法
TP393; 针对传统基于信任网络的服务推荐算法中信任关系稀疏以及通过QoS预测值排序得到的服务推荐列表不一定最符合用户偏好等问题,提出基于信任扩展和列表级排序学习的服务推荐方法(TELSR).在分析服务排序位置信息的重要性后给出概率型用户相似度计算方法,进一步提高相似度计算的准确性;利用信任扩展模型解决用户信任关系稀疏性问题,并结合用户相似度给出可信邻居集合构建方法;基于可信邻居集合,利用列表级排序学习方法训练出最优排序模型.仿真实验表明,与已有算法相比,TELSR在具有较高推荐精度的同时,还可有效抵抗恶意用户的攻击....
Saved in:
| Published in | 通信学报 Vol. 39; no. 1; pp. 147 - 158 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | Chinese |
| Published |
信息工程大学三院,河南郑州450001
25.01.2018
数字工程与先进计算国家重点实验室,河南郑州450001 |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1000-436X |
| DOI | 10.11959/j.issn.1000-436x.2018007 |
Cover
| Abstract | TP393; 针对传统基于信任网络的服务推荐算法中信任关系稀疏以及通过QoS预测值排序得到的服务推荐列表不一定最符合用户偏好等问题,提出基于信任扩展和列表级排序学习的服务推荐方法(TELSR).在分析服务排序位置信息的重要性后给出概率型用户相似度计算方法,进一步提高相似度计算的准确性;利用信任扩展模型解决用户信任关系稀疏性问题,并结合用户相似度给出可信邻居集合构建方法;基于可信邻居集合,利用列表级排序学习方法训练出最优排序模型.仿真实验表明,与已有算法相比,TELSR在具有较高推荐精度的同时,还可有效抵抗恶意用户的攻击. |
|---|---|
| AbstractList | TP393; 针对传统基于信任网络的服务推荐算法中信任关系稀疏以及通过QoS预测值排序得到的服务推荐列表不一定最符合用户偏好等问题,提出基于信任扩展和列表级排序学习的服务推荐方法(TELSR).在分析服务排序位置信息的重要性后给出概率型用户相似度计算方法,进一步提高相似度计算的准确性;利用信任扩展模型解决用户信任关系稀疏性问题,并结合用户相似度给出可信邻居集合构建方法;基于可信邻居集合,利用列表级排序学习方法训练出最优排序模型.仿真实验表明,与已有算法相比,TELSR在具有较高推荐精度的同时,还可有效抵抗恶意用户的攻击. |
| Abstract_FL | In view of the problem of trust relationship in traditional trust-based service recommendation algorithm,and the inaccuracy of service recommendation list obtained by sorting the predicted QoS,a trust expansion and listwise learning-to-rank based service recommendation method (TELSR) was proposed.The probabilistic user similarity computation method was proposed after analyzing the importance of service sorting information,in order to further improve the accuracy of similarity computation.The trust expansion model was presented to solve the sparseness of trust relationship,and then the trusted neighbor set construction algorithm was proposed by combining with the user similarity.Based on the trusted neighbor set,the listwise learning-to-rank algorithm was proposed to train an optimal ranking model.Simulation experiments show that TELSR not only has high recommendation accuracy,but also can resist attacks from malicious users. |
| Author | 张铭 王晋东 张恒巍 方晨 |
| AuthorAffiliation | 信息工程大学三院,河南郑州450001;数字工程与先进计算国家重点实验室,河南郑州450001 |
| AuthorAffiliation_xml | – name: 信息工程大学三院,河南郑州450001;数字工程与先进计算国家重点实验室,河南郑州450001 |
| Author_FL | ZHANG Hengwei FANG Chen ZHANG Ming WANG Jindong |
| Author_FL_xml | – sequence: 1 fullname: FANG Chen – sequence: 2 fullname: ZHANG Hengwei – sequence: 3 fullname: ZHANG Ming – sequence: 4 fullname: WANG Jindong |
| Author_xml | – sequence: 1 fullname: 方晨 – sequence: 2 fullname: 张恒巍 – sequence: 3 fullname: 张铭 – sequence: 4 fullname: 王晋东 |
| BookMark | eNo1j7tKA0EYRqeIYIx5CAvLXf9_Z2YvlUjwBgEbBbuwu5mRBJmAq7gPYKFiEglEQQTdRmNhIVbZFL7MziSPYfBSHTjF-fiWSEl1lCBkBcFGDHiw1rZbSaJsBACLUTe1HUAfwCuR8r87XCTVJGlFwJF6LlAsk3X9lBd5r_jKisnEXL3pj6Ee3OjL-1k2muavpjfQeV-_vxTj5-nDhXns6uvM9Eaz7q25G5vP4TJZkOFxIqp_rJCDrc392o5V39verW3UrRgdj1kud6mQIfdlIJhHo8iPo9gFBwNHNjlngQQeN32UyOaWY-CH1BEM_FBwYCymFbL62z0PlQzVUaPdOTtR88XGaZpGP1cRkNFvq4NkEw |
| ClassificationCodes | TP393 |
| ContentType | Journal Article |
| Copyright | Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| Copyright_xml | – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved. |
| DBID | 2B. 4A8 92I 93N PSX TCJ |
| DOI | 10.11959/j.issn.1000-436x.2018007 |
| DatabaseName | Wanfang Data Journals - Hong Kong WANFANG Data Centre Wanfang Data Journals 万方数据期刊 - 香港版 China Online Journals (COJ) China Online Journals (COJ) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| DocumentTitle_FL | Trust expansion and listwise learning-to-rank based service recommendation method |
| EndPage | 158 |
| ExternalDocumentID | txxb201801014 |
| GrantInformation_xml | – fundername: 国家自然科学基金资助项目; 河南省科技攻关计划基金资助项目(No.12210231003)The National Natural Science Foundation of China; Henan Science and Technology Research Project funderid: (61303074,61309013); (61303074,61309013); (12210231003) |
| GroupedDBID | -0Y 2B. 4A8 92I 93N ALMA_UNASSIGNED_HOLDINGS CCEZO CUBFJ GROUPED_DOAJ PSX TCJ |
| ID | FETCH-LOGICAL-c1274-6563efa58f9e473bb8cbc602192fd5549f05cd81f146025198a32e408ae5044c3 |
| ISSN | 1000-436X |
| IngestDate | Thu May 29 04:00:48 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 信任关系 probabilistic user similarity service recommendation 服务推荐 排序学习 learning-to-rank 概率型用户相似度 trust relationship |
| Language | Chinese |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c1274-6563efa58f9e473bb8cbc602192fd5549f05cd81f146025198a32e408ae5044c3 |
| PageCount | 12 |
| ParticipantIDs | wanfang_journals_txxb201801014 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-01-25 |
| PublicationDateYYYYMMDD | 2018-01-25 |
| PublicationDate_xml | – month: 01 year: 2018 text: 2018-01-25 day: 25 |
| PublicationDecade | 2010 |
| PublicationTitle | 通信学报 |
| PublicationTitle_FL | Journal on Communications |
| PublicationYear | 2018 |
| Publisher | 信息工程大学三院,河南郑州450001 数字工程与先进计算国家重点实验室,河南郑州450001 |
| Publisher_xml | – name: 信息工程大学三院,河南郑州450001 – name: 数字工程与先进计算国家重点实验室,河南郑州450001 |
| SSID | ssib051376031 ssj0002912165 ssib058759023 ssib001102965 ssib023646527 ssib023168036 ssib036439991 ssib050281523 ssib000968473 |
| Score | 2.202733 |
| Snippet | TP393; 针对传统基于信任网络的服务推荐算法中信任关系稀疏以及通过QoS预测值排序得到的服务推荐列表不一定最符合用户偏好等问题,提出基于信任扩展和列表级排序学习的服务... |
| SourceID | wanfang |
| SourceType | Aggregation Database |
| StartPage | 147 |
| Title | 基于信任扩展和列表级排序学习的服务推荐方法 |
| URI | https://d.wanfangdata.com.cn/periodical/txxb201801014 |
| Volume | 39 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources issn: 1000-436X databaseCode: M~E dateStart: 19800101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://road.issn.org omitProxy: true ssIdentifier: ssib058759023 providerName: ISSN International Centre |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Na9RAFA9tBfEiioqfpYJzTM1MZpKZk8xusxShnlrorSTZiZ5W0C0sPXjyoGKrFKoggvai9eBBPHV78J_ZbPtn-N4km6RY8QOW8Dbz5s2b92Yyv0lm5jnOLV-mwrDAuAkznsu7Xc-N_Ri6uwi7CY9p3GW4wXnpXrC4wu-uitWpadNYtbTeT-bTjRP3lfyPV-Ee-BV3yf6DZyuhcANo8C9cwcNw_Ssfk0gQ1SEtTSKOVxlZokM0tUQLf1FApCJaIXOLEiVsLkZkGwkpiQpJJDGLliQKUY4Oba4I2TAXSO4goReIDqxkEOghs4IkjsyqTeSCFaht6TY7CpR4X3mWJ8CMQLR8UsS8nMBiEim75EI39K-KC6xMMWkaxyQpUETWKaBr22oGeehE-xA0OIFFEeUT3UgJUWXZKsUiAbqAedrNNyMUF-W5xS5q25YbGttCdacsVAsUCSZASVAZbs3aNKJEx6AeUAkGbd2ahqF10I4L1jGgCBiLljJVxDG0BG0MJbhnn_s2TmM11hQHNx3rU8XAQYtzR0sMQovj7H8d3pRQdnzDEuYnJQxwhSIA_7Ae06uVlv3BILGpGJN52jnFwiDAQB9LT6LmLBYwSnN7tcdU_fGbYWwzADr1_4AHglWo1UdQq-ojlwRAVkCFlTxBceFV_bFZwBRZlaGqLGBiijJqg75WNjvt3JzU9_bvamu32fWyuHe_gQiXzzlny6ncnC765XlnauPBBedO_mE4Gm6NfuyODg7Gz7_k33by7Zf5s7dHu3uHw8_jre18-Cr_-mm0__Hw3dPx-838xe54a-9o8_X4zf74-85FZ6UTLbcX3TJIiZtSFnIX5kO-yWIhM2XAiEki0yQNADkrlnUBq6vMw_M3aAaQBOfzSsY-M9yTsREe56l_yZnpPeyZy86cl4SeyIxkoYJ5u8_iwDB84R8nocnSRF1xZssKr5UPocdrx_x79U8M15wzdUe57sz0H62bGwCq-8msbRI_AX1nmG4 |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E4%BF%A1%E4%BB%BB%E6%89%A9%E5%B1%95%E5%92%8C%E5%88%97%E8%A1%A8%E7%BA%A7%E6%8E%92%E5%BA%8F%E5%AD%A6%E4%B9%A0%E7%9A%84%E6%9C%8D%E5%8A%A1%E6%8E%A8%E8%8D%90%E6%96%B9%E6%B3%95&rft.jtitle=%E9%80%9A%E4%BF%A1%E5%AD%A6%E6%8A%A5&rft.au=%E6%96%B9%E6%99%A8&rft.au=%E5%BC%A0%E6%81%92%E5%B7%8D&rft.au=%E5%BC%A0%E9%93%AD&rft.au=%E7%8E%8B%E6%99%8B%E4%B8%9C&rft.date=2018-01-25&rft.pub=%E4%BF%A1%E6%81%AF%E5%B7%A5%E7%A8%8B%E5%A4%A7%E5%AD%A6%E4%B8%89%E9%99%A2%2C%E6%B2%B3%E5%8D%97%E9%83%91%E5%B7%9E450001&rft.issn=1000-436X&rft.volume=39&rft.issue=1&rft.spage=147&rft.epage=158&rft_id=info:doi/10.11959%2Fj.issn.1000-436x.2018007&rft.externalDocID=txxb201801014 |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Ftxxb%2Ftxxb.jpg |