%0 Conference Paper %1 Chen2022 %A Chen, Yankai %A Yang, Menglin %A Zhang, Yingxue %A Zhao, Mengchen %A Meng, Ziqiao %A Hao, Jianye %A King, Irwin %B Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining %C New York, NY, USA %D 2022 %I Association for Computing Machinery %K graph-based knowledge_graph recommendation %P 94–102 %R 10.1145/3488560.3498419 %T Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendation %U https://doi.org/10.1145/3488560.3498419 %X Aiming to alleviate data sparsity and cold-start problems of tradi- tional recommender systems, incorporating knowledge graphs (KGs) to supplement auxiliary information has recently gained considerable attention. Via unifying the KG with user-item interactions into a tripartite graph, recent works explore the graph topologies to learn the low-dimensional representations of users and items with rich semantics. These real-world tripartite graphs are usually scale-free, however, the intrinsic hierarchical graph structures of which are underemphasized in existing works, consequently, leading to suboptimal recommendation performance. To address this issue and provide more accurate recommendation, we propose a knowledge-aware recommendation method with Lorentz model of the hyperbolic geometry, namely Lorentzian Knowledge-enhanced Graph convolutional networks for Recommendation (LKGR). LKGR facilitates better modeling of scale-free tripartite graphs after the data unification. Specifically, we employ different information propagation strategies in the hyperbolic space to explicitly encode heterogeneous information from historical interactions and KGs. Additionally, our proposed knowledge-aware attention mechanism enables the model to automatically measure the information contribution, producing the coherent information aggregation in the hyperbolic space. Extensive experiments on three real-world benchmarks demonstrate that LKGR outperforms state-of-the-art methods by 3.6-15.3% of Recall@20 on Top-K recommendation. %@ 9781450391320

@inproceedings{Chen2022, abstract = {Aiming to alleviate data sparsity and cold-start problems of tradi- tional recommender systems, incorporating knowledge graphs (KGs) to supplement auxiliary information has recently gained considerable attention. Via unifying the KG with user-item interactions into a tripartite graph, recent works explore the graph topologies to learn the low-dimensional representations of users and items with rich semantics. These real-world tripartite graphs are usually scale-free, however, the intrinsic hierarchical graph structures of which are underemphasized in existing works, consequently, leading to suboptimal recommendation performance. To address this issue and provide more accurate recommendation, we propose a knowledge-aware recommendation method with Lorentz model of the hyperbolic geometry, namely Lorentzian Knowledge-enhanced Graph convolutional networks for Recommendation (LKGR). LKGR facilitates better modeling of scale-free tripartite graphs after the data unification. Specifically, we employ different information propagation strategies in the hyperbolic space to explicitly encode heterogeneous information from historical interactions and KGs. Additionally, our proposed knowledge-aware attention mechanism enables the model to automatically measure the information contribution, producing the coherent information aggregation in the hyperbolic space. Extensive experiments on three real-world benchmarks demonstrate that LKGR outperforms state-of-the-art methods by 3.6-15.3% of Recall@20 on Top-K recommendation.}, added-at = {2024-05-02T11:27:05.000+0200}, address = {New York, NY, USA}, author = {Chen, Yankai and Yang, Menglin and Zhang, Yingxue and Zhao, Mengchen and Meng, Ziqiao and Hao, Jianye and King, Irwin}, biburl = {https://www.bibsonomy.org/bibtex/23e669977c5205bc9bd9c0160af34f00b/e.fischer}, booktitle = {Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining}, day = 15, description = {https://dl.acm.org/doi/pdf/10.1145/3488560.3498419}, doi = {10.1145/3488560.3498419}, interhash = {f2c5e1e33314c16ae1e8d2fc9c0be553}, intrahash = {3e669977c5205bc9bd9c0160af34f00b}, isbn = {9781450391320}, keywords = {graph-based knowledge_graph recommendation}, location = {Virtual Event, AZ, USA}, month = {2}, pages = {94–102}, publisher = {Association for Computing Machinery}, series = {WSDM '22}, timestamp = {2024-05-02T11:27:05.000+0200}, title = {Modeling Scale-free Graphs with Hyperbolic Geometry for Knowledge-aware Recommendation}, url = {https://doi.org/10.1145/3488560.3498419}, year = 2022 }