ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
2.0k
Citations
0
Influential Citations
IEEE Transactions on Knowledge and Data Engineering
Venue
2018
Year
Graph is an important data representation which appears in a wide diversity of real-world scenarios. Effective graph analytics provides users a deeper understanding of what is behind the data, and thus can benefit a lot of useful applications such as node classification, node recommendation, link prediction, etc. However, most graph analytics methods suffer the high computation and space cost. Graph embedding is an effective yet efficient way to solve the graph analytics problem. It converts the graph data into a low dimensional space in which the graph structural information and graph properties are maximumly preserved. In this survey, we conduct a comprehensive review of the literature in graph embedding. We first introduce the formal definition of graph embedding as well as the related concepts. After that, we propose two taxonomies of graph embedding which correspond to what challenges exist in different graph embedding problem settings and how the existing work addresses these challenges in their solutions. Finally, we summarize the applications that graph embedding enables and suggest four promising future research directions in terms of computation efficiency, problem settings, techniques, and application scenarios.
Graphs are ubiquitous in real-world data, from social networks to knowledge graphs, but traditional graph analytics often suffer from high computational and space costs. Graph embedding offers an efficient solution by mapping graph data into a low-dimensional space while preserving structural information and properties. This survey, published in IEEE TKDE in 2018, provides a timely and comprehensive overview of the rapidly growing field of graph embedding. With over 2000 citations, it has become a key reference for researchers and practitioners seeking to understand the landscape of graph representation learning.
The paper's significance lies in its systematic organization of the literature. By proposing two taxonomies—one based on problem settings and challenges, and another based on solution techniques—it helps readers navigate the diverse and often fragmented body of work. This structured approach not only clarifies the current state of the art but also highlights gaps and opportunities for future research. As graph embedding continues to be a foundational technique for knowledge graphs and beyond, this survey's impact is likely to endure.
As a survey paper, it does not report new experimental results. Instead, its "results" are the synthesized insights from reviewing numerous methods. The paper successfully categorizes existing work, revealing trends and gaps. For instance, it notes that while many methods exist for static graphs, dynamic and heterogeneous graphs pose additional challenges. The proposed taxonomies enable comparative analysis and highlight that different problem settings often require tailored techniques. The identification of future directions has been influential, with subsequent research addressing some of the suggested areas, such as scalability and dynamic graphs.
The survey's significance extends beyond academia. By providing a clear framework and comprehensive overview, it lowers the entry barrier for newcomers and facilitates the adoption of graph embedding in industry. Its citation count attests to its role as a foundational reference. Moreover, the paper's emphasis on efficiency and application scenarios aligns with the practical needs of AI practitioners, especially in knowledge graph applications where embedding techniques are crucial for tasks like link prediction and entity resolution. The survey also helped shape the research agenda by outlining open problems, many of which have since been tackled by the graph neural network community. Overall, it remains a valuable resource for understanding the evolution and future of graph embedding.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba