Graph neural networks: foundation, frontiers and applications

L Wu, P Cui, J Pei, L Zhao, X Guo - … of the 28th ACM SIGKDD conference …, 2022 - dl.acm.org
The field of graph neural networks (GNNs) has seen rapid and incredible strides over the
recent years. Graph neural networks, also known as deep learning on graphs, graph …

A survey on network embedding

P Cui, X Wang, J Pei, W Zhu - IEEE transactions on knowledge …, 2018 - ieeexplore.ieee.org
Network embedding assigns nodes in a network to low-dimensional representations and
effectively preserves the network structure. Recently, a significant amount of progresses …

Learning to hash for indexing big data—A survey

J Wang, W Liu, S Kumar, SF Chang - Proceedings of the IEEE, 2015 - ieeexplore.ieee.org
The explosive growth in Big Data has attracted much attention in designing efficient indexing
and search methods recently. In many critical applications such as large-scale search and …

Structural deep embedding for hyper-networks

K Tu, P Cui, X Wang, F Wang, W Zhu - Proceedings of the AAAI …, 2018 - ojs.aaai.org
Network embedding has recently attracted lots of attentions in data mining. Existing network
embedding methods mainly focus on networks with pairwise relationships. In real world …

Dynamic knowledge graph alignment

Y Yan, L Liu, Y Ban, B **g, H Tong - … of the AAAI conference on artificial …, 2021 - ojs.aaai.org
Abstract Knowledge graph (KG for short) alignment aims at building a complete KG by
linking the shared entities across complementary KGs. Existing approaches assume that …

Timers: Error-bounded svd restart on dynamic networks

Z Zhang, P Cui, J Pei, X Wang, W Zhu - Proceedings of the AAAI …, 2018 - ojs.aaai.org
Abstract Singular Value Decomposition (SVD) is a popular approach in various network
applications, such as link prediction and network parameter characterization. Incremental …

Fast scalable supervised hashing

X Luo, L Nie, X He, Y Wu, ZD Chen, XS Xu - The 41st international ACM …, 2018 - dl.acm.org
Despite significant progress in supervised hashing, there are three common limitations of
existing methods. First, most pioneer methods discretely learn hash codes bit by bit, making …

BO-LSTM: classifying relations via long short-term memory networks along biomedical ontologies

A Lamurias, D Sousa, LA Clarke, FM Couto - BMC bioinformatics, 2019 - Springer
Background Recent studies have proposed deep learning techniques, namely recurrent
neural networks, to improve biomedical text mining tasks. However, these techniques rarely …

Depthlgp: Learning embeddings of out-of-sample nodes in dynamic networks

J Ma, P Cui, W Zhu - Proceedings of the AAAI Conference on Artificial …, 2018 - ojs.aaai.org
Network embedding algorithms to date are primarily designed for static networks, where all
nodes are known before learning. How to infer embeddings for out-of-sample nodes, ie …

A heterogeneous graph embedding framework for location-based social network analysis in smart cities

Y Wang, H Sun, Y Zhao, W Zhou… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
In recent years, with the advancement of wireless communication and location acquisition
technology in the context of modern smart cities, and the increasing popularity of mobile …