Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.07402 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913513815932928 |
|---|---|
| author | Bozorgi, Elika Alqaiidi, Sakher Khalil Shams, Afsaneh Arabnia, Hamid Reza Kochut, Krzysztof |
| author_facet | Bozorgi, Elika Alqaiidi, Sakher Khalil Shams, Afsaneh Arabnia, Hamid Reza Kochut, Krzysztof |
| contents | Machine learning, deep learning, and NLP methods on knowledge graphs are present in different fields and have important roles in various domains from self-driving cars to friend recommendations on social media platforms. However, to apply these methods to knowledge graphs, the data usually needs to be in an acceptable size and format. In fact, knowledge graphs normally have high dimensions and therefore we need to transform them to a low-dimensional vector space. An embedding is a low-dimensional space into which you can translate high dimensional vectors in a way that intrinsic features of the input data are preserved. In this review, we first explain knowledge graphs and their embedding and then review some of the random walk-based embedding methods that have been developed recently. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_07402 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Survey on Recent Random Walk-based Methods for Embedding Knowledge Graphs Bozorgi, Elika Alqaiidi, Sakher Khalil Shams, Afsaneh Arabnia, Hamid Reza Kochut, Krzysztof Machine Learning Machine learning, deep learning, and NLP methods on knowledge graphs are present in different fields and have important roles in various domains from self-driving cars to friend recommendations on social media platforms. However, to apply these methods to knowledge graphs, the data usually needs to be in an acceptable size and format. In fact, knowledge graphs normally have high dimensions and therefore we need to transform them to a low-dimensional vector space. An embedding is a low-dimensional space into which you can translate high dimensional vectors in a way that intrinsic features of the input data are preserved. In this review, we first explain knowledge graphs and their embedding and then review some of the random walk-based embedding methods that have been developed recently. |
| title | A Survey on Recent Random Walk-based Methods for Embedding Knowledge Graphs |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2406.07402 |