no code implementations • 21 May 2022 • Xuhong Wang, Sirui Chen, Yixuan He, Minjie Wang, Quan Gan, Yupu Yang, Junchi Yan
Many real world applications can be formulated as event forecasting on Continuous Time Dynamic Graphs (CTDGs) where the occurrence of a timed event between two entities is represented as an edge along with its occurrence timestamp in the graphs. However, most previous works approach the problem in compromised settings, either formulating it as a link prediction task on the graph given the event time or a time prediction problem given which event will happen next.
1 code implementation • 23 Nov 2020 • Xuhong Wang, Ding Lyu, Mengjian Li, Yang Xia, Qi Yang, Xinwen Wang, Xinguang Wang, Ping Cui, Yupu Yang, Bowen Sun, Zhenyu Guo
Limited by the time complexity of querying k-hop neighbors in a graph database, most graph algorithms cannot be deployed online and execute millisecond-level inference.
3 code implementations • 22 Feb 2020 • Xuhong Wang, Baihong Jin, Ying Du, Ping Cui, Yupu Yang
Since traditional anomaly detection methods are stable, robust and easy to use, it is vitally important to generalize them to graph data.
2 code implementations • 3 Mar 2019 • Xuhong Wang, Ying Du, Shi-Jie Lin, Ping Cui, Yuntian Shen, Yupu Yang
We assume that both the anomalous and the normal prior distribution are Gaussian and have overlaps in the latent space.