Context-Aware Service Recommendation Based on Knowledge Graph Embedding

被引:66
作者
Mezni, Haithem [1 ]
Benslimane, Djamal [2 ]
Bellatreche, Ladjel [3 ]
机构
[1] Taibah Univ, Dept Comp Informat Sci, Medina 42353, Saudi Arabia
[2] Claude Bernard Univ, F-69373 Lyon, France
[3] Natl Engn Sch Mech & Aerotech, F-86961 Poitiers, France
关键词
Knowledge engineering; Context-aware services; Recommender systems; Data mining; Context modeling; Social networking (online); Data models; Service recommendation; context-awareness; knowledge graph; knowledge graph embedding; subgraph-aware proximity; dilated recurrent neural networks; SYSTEMS;
D O I
10.1109/TKDE.2021.3059506
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Over two decades, context awareness has been incorporated into recommender systems in order to provide, not only the top-rated items to consumers but also the ones that are suitable to the user context. As a class of context-aware systems, context-aware service recommendation (CASR) aims to bind high-quality services to users, while taking into account their context requirements, including invocation time, location, social profiles, connectivity, and so on. However, current CASR approaches are not scalable with the huge amount of service data (QoS and context information, users reviews and feedbacks). In addition, they lack a rich representation of contextual information, as they adopt a simple matrix view. Moreover, current CASR approaches adopt the traditional user-service relation and they do not allow for multi-relational interactions between users and services in different contexts. To offer a scalable and context-sensitive service recommendation with great analysis and learning capabilities, we provide a rich and multi-relational representation of the CASR knowledge, based on the concept of knowledge graph. The constructed context-aware service knowledge graph (C-SKG) is, then, transformed into a low-dimensional vector space to facilitate its processing. For this purpose, we adopt Dilated Recurrent Neural Networks to propose a context-aware knowledge graph embedding, based on the principles of first-order and subgraph-aware proximity. Finally, a recommendation algorithm is defined to deliver the top-rated services according to the target user's context. Experiments have proved the accuracy and scalability of our solution, compared to state-of-the-art CASR approaches.
引用
收藏
页码:5225 / 5238
页数:14
相关论文
共 62 条
[1]   Incorporating contextual information in recommender systems using a multidimensional approach [J].
Adomavicius, G ;
Sankaranarayanan, R ;
Sen, S ;
Tuzhilin, A .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2005, 23 (01) :103-145
[2]  
[Anonymous], 2008, P 25 INT C MACH LEAR, DOI DOI 10.1145/1390156.1390177
[3]  
Bai Q., 2020, PROC AUSTRALAS COMPU, P1
[4]  
Bellomarini L, 2017, PROCEEDINGS OF THE TWENTY-SIXTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P2
[5]   The contribution of linked open data to augment a traditional data warehouse [J].
Berkani, Nabila ;
Bellatreche, Ladjel ;
Khouri, Selma ;
Ordonez, Carlos .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2020, 55 (03) :397-421
[6]   A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications [J].
Cai, HongYun ;
Zheng, Vincent W. ;
Chang, Kevin Chen-Chuan .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2018, 30 (09) :1616-1637
[7]   An Efficient Knowledge-Graph-Based Web Service Recommendation Algorithm [J].
Cao, Zhiying ;
Qiao, Xinghao ;
Jiang, Shuo ;
Zhang, Xiuguo .
SYMMETRY-BASEL, 2019, 11 (03)
[8]  
Chang SY, 2017, ADV NEUR IN, V30
[9]   A review: Knowledge reasoning over knowledge graph [J].
Chen, Xiaojun ;
Jia, Shengbin ;
Xiang, Yang .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 141
[10]   Time-Aware Smart Object Recommendation in Social Internet of Things [J].
Chen, Yuanyi ;
Zhou, Mingxuan ;
Zheng, Zengwei ;
Chen, Dan .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (03) :2014-2027