Abstract
Graph-structured data is ubiquitous in science, engineering and has been successfully used in various real-life applications for social networks, molecular graphs, and biological networks. Hence, it is worth exploring prospective mechanisms to deal with the unprecedented growth in volumes and problem complexity of graph-structured data. Graph representation learning has recently emerged as a new promising paradigm, which learns a parametric mapping function that embeds nodes, subgraphs, or the entire graph into low-dimensional continuous vectors. In this thesis, we focus on developing novel and advanced graph embedding models for the two most popular types of graphs: undirected graph and knowledge graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
