Sun, Sirui
(Beijing University of Posts and Telecommunications, Beijing, China)
,
Wu, Bin
(Beijing University of Posts and Telecommunications, Beijing, China)
,
Zhang, Zixing
(Beijing University of Posts and Telecommunications, Beijing, China)
,
Ning, Nianwen
(Beijing University of Posts and Telecommunications, Beijing, China)
,
Wang, Bai
(Beijing University of Posts and Telecommunications, Beijing, China)
Graph has been widely used for modeling complex relationship datasets in different application fields. Social networks based recommendation system have obtained satisfactory results in Business Intelligence(BI). However, current personalized recommendation methods based on graph structure generally ...
Graph has been widely used for modeling complex relationship datasets in different application fields. Social networks based recommendation system have obtained satisfactory results in Business Intelligence(BI). However, current personalized recommendation methods based on graph structure generally lack interactivity and seldom consider efficient data management. To address these problems, Graph On-Line Analytical Mining (GraphOLAM) is a promising method, which combines OLAP technology with social networks. We first propose an efficient recommendation framework based on GraphOLAM data cube technology for the recommendation in the insurance service. Based on this framework, a new algorithm framework named RU-GOLAM for insurance is proposed, which combines GraphOLAM dimensional aggregation operation and specific recommendation methods. A series of graphs can be generated by GraphOLAM dimensional aggregation operations, which reflect the relationships of nodes under the constraints of different hierarchical dimensions. Node similarities are calculated to generate the Top-N sequential recommendation based on all of these graphs, which can achieve the balance between the topology of the original graph and high-dimensional information of the nodes. Experiments show that our approach outperforms other baseline algorithms on an insurance service dataset.
Graph has been widely used for modeling complex relationship datasets in different application fields. Social networks based recommendation system have obtained satisfactory results in Business Intelligence(BI). However, current personalized recommendation methods based on graph structure generally lack interactivity and seldom consider efficient data management. To address these problems, Graph On-Line Analytical Mining (GraphOLAM) is a promising method, which combines OLAP technology with social networks. We first propose an efficient recommendation framework based on GraphOLAM data cube technology for the recommendation in the insurance service. Based on this framework, a new algorithm framework named RU-GOLAM for insurance is proposed, which combines GraphOLAM dimensional aggregation operation and specific recommendation methods. A series of graphs can be generated by GraphOLAM dimensional aggregation operations, which reflect the relationships of nodes under the constraints of different hierarchical dimensions. Node similarities are calculated to generate the Top-N sequential recommendation based on all of these graphs, which can achieve the balance between the topology of the original graph and high-dimensional information of the nodes. Experiments show that our approach outperforms other baseline algorithms on an insurance service dataset.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.