Siman Wang , Xu Chen , Yongjun Jing , Shuyang Wang
{"title":"双曲几何图形表示学习综述","authors":"Siman Wang , Xu Chen , Yongjun Jing , Shuyang Wang","doi":"10.1016/j.cosrev.2025.100800","DOIUrl":null,"url":null,"abstract":"<div><div>Graph representation learning is a crucial technology, which converts graph data into low-dimensional vector representations and significantly enhances various machine learning tasks. Traditional Euclidean space often faces the curse of dimensionality when representing graph structures, especially for graph data possessing complex relationships. Hyperbolic geometry, as a form of non-Euclidean geometry, has superior capabilities to more accurately capture the graph data of nonlinear relationships and hierarchical structures, making it an effective tool for handling complex graph data. To stimulate future research, this paper presents a comprehensive reviews of literature around the graph representation learning in hyperbolic geometry. We offer a new taxonomy of hyperbolic graph representation methods by embedding graph data with different structures into various geometric spaces, including hyperbolic space graph representation learning and spatial fusion graph representation learning. Moreover, it emphasizes the applications of hyperbolic geometric representation learning across various domains, such as knowledge graphs, recommendation systems, biomolecular analysis, and natural language processing, while also exploring potential future research directions.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"58 ","pages":"Article 100800"},"PeriodicalIF":12.7000,"publicationDate":"2025-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hyperbolic geometric graph representation learning: A survey\",\"authors\":\"Siman Wang , Xu Chen , Yongjun Jing , Shuyang Wang\",\"doi\":\"10.1016/j.cosrev.2025.100800\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Graph representation learning is a crucial technology, which converts graph data into low-dimensional vector representations and significantly enhances various machine learning tasks. Traditional Euclidean space often faces the curse of dimensionality when representing graph structures, especially for graph data possessing complex relationships. Hyperbolic geometry, as a form of non-Euclidean geometry, has superior capabilities to more accurately capture the graph data of nonlinear relationships and hierarchical structures, making it an effective tool for handling complex graph data. To stimulate future research, this paper presents a comprehensive reviews of literature around the graph representation learning in hyperbolic geometry. We offer a new taxonomy of hyperbolic graph representation methods by embedding graph data with different structures into various geometric spaces, including hyperbolic space graph representation learning and spatial fusion graph representation learning. Moreover, it emphasizes the applications of hyperbolic geometric representation learning across various domains, such as knowledge graphs, recommendation systems, biomolecular analysis, and natural language processing, while also exploring potential future research directions.</div></div>\",\"PeriodicalId\":48633,\"journal\":{\"name\":\"Computer Science Review\",\"volume\":\"58 \",\"pages\":\"Article 100800\"},\"PeriodicalIF\":12.7000,\"publicationDate\":\"2025-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1574013725000760\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Review","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574013725000760","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Hyperbolic geometric graph representation learning: A survey
Graph representation learning is a crucial technology, which converts graph data into low-dimensional vector representations and significantly enhances various machine learning tasks. Traditional Euclidean space often faces the curse of dimensionality when representing graph structures, especially for graph data possessing complex relationships. Hyperbolic geometry, as a form of non-Euclidean geometry, has superior capabilities to more accurately capture the graph data of nonlinear relationships and hierarchical structures, making it an effective tool for handling complex graph data. To stimulate future research, this paper presents a comprehensive reviews of literature around the graph representation learning in hyperbolic geometry. We offer a new taxonomy of hyperbolic graph representation methods by embedding graph data with different structures into various geometric spaces, including hyperbolic space graph representation learning and spatial fusion graph representation learning. Moreover, it emphasizes the applications of hyperbolic geometric representation learning across various domains, such as knowledge graphs, recommendation systems, biomolecular analysis, and natural language processing, while also exploring potential future research directions.
期刊介绍:
Computer Science Review, a publication dedicated to research surveys and expository overviews of open problems in computer science, targets a broad audience within the field seeking comprehensive insights into the latest developments. The journal welcomes articles from various fields as long as their content impacts the advancement of computer science. In particular, articles that review the application of well-known Computer Science methods to other areas are in scope only if these articles advance the fundamental understanding of those methods.