Review of Graph Embedding Learning Research:From Simple Graph to Complex Graph

Graph data,as a data type with strong expressive power,is difficult to model efficiently due to its complex structure.How to effectively capture its intrinsic information has become a challenging problem.Graph embedding methods have received increasing attention by mapping high-dimensional sparse graphs into low-dimensional dense feature vectors,while preserving the structural information of graphs.However,the existing reviews do not summarize the graph embedding methods comprehensively enough,especially paying less attention to complex graph embedding,which leads to the failure to systematically sort out the current status of research on graph embedding in dealing with diverse graph data.Therefore,this paper presents a systematic review of graph embedding learning methods from simple to complex graphs.Firstly,it gives the common definitions of various types of graphs and graph embedding.Secondly,it systematically summarizes the embedding methods on simple graphs,including shallow and deep embedding methods.Then,it summarizes the embedding methods on complex graphs according to the types of graphs,focusing on the application of deep embedding techniques in complex graph structures such as dynamic graphs,heterogeneous graphs,multiplex graphs,and hypergraphs,to fill the gaps in the existing literature that is insufficiently researched on complex graph structures.Finally,it discusses the practical application scenarios of graph embedding techniques,and looks forward to the future development directions.