The staleness problem is a well-known problem when working with dynamic data, due to the absence of events for a long time. Since the memory of the node is updated only when the node is involved in an event, its memory becomes stale. Usually, it refers to a lack of events such as a temporal deactivation of a social account. To overcome the memory staleness problem aggregate information from the nodes neighbors memory in addition to the nodes memory. Inspired by that, we design an updated embedding module that inserts the most similar node in addition to the nodes neighbors. Our method achieved similar results to the TGN, with a slight improvement. This could indicate a potential improvement after fine-tuning our hyper-parameters, especially the time threshold, and using a learnable similarity metric.
Rethinking Causal Relationships Learning in Graph Neural Networks
Science and Technology on Integrated Information System Laboratory, Institute of Software Chinese Academy of Sciences(中国科学院软件研究所综合信息系统技术国家级重点实验室);University of Chinese Academy of Sciences(中国科学院大学);State Key Laboratory of Intelligent Game(智能博弈国家重点实验室);Department of Computer Science and Technology, Tsinghua University(清华大学计算机科学与技术系)
Rethinking Graph Neural Networks for the Graph Coloring Problem
Carnegie Mellon University(卡内基梅隆大学);The Chinese University of Hong Kong(香港中文大学);The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));The University of Texas at Austin(德克萨斯大学奥斯汀分校)
Rethinking Efficiency and Redundancy in Training Large-scale Graphs
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);ShanghaiTech University(上海科技大学);Griffith University(格里菲斯大学)
Rethinking Independent Cross-Entropy Loss For Graph-Structured Data
School of Artificial Intelligence, Jilin University(吉林大学人工智能学院);Institute for Medical Engineering Science, Massachusetts Institute of Technology(麻省理工学院医学工程科学研究所);School of Computing, University of Georgia(佐治亚大学计算学院);College of Computer Science and Technology, Jilin University(吉林大学计算机科学与技术学院)
EdgeGFL: Rethinking Edge Information in Graph Feature Preference Learning
College of Cyber Security, Jinan University(暨南大学网络空间安全学院);School of Management, Jinan University(暨南大学管理学院);School of Computer, Sun Yat-sen University(中山大学计算机学院);School of Computer Science and Engineering, South China University of Technology(华南理工大学计算机科学与工程学院);Guangdong Key Laboratory of Data Security and Privacy Preserving(广东省数据安全与隐私保护重点实验室)
NN-Former: Rethinking Graph Structure in Neural Architecture Representation
State Key Laboratory of Multimedia Information Processing, School of Computer Science, Peking University(多媒体信息处理国家重点实验室,计算机学院,北京大学);Northwestern Polytechnical University(西北工业大学);Harbin Institute of Technology (Shenzhen)(哈尔滨工业大学(深圳))
Rethinking Federated Graph Learning: A Data Condensation Perspective
Computer Network Information Center, Chinese Academy of Sciences(中国科学院计算机网络信息中心);University of Chinese Academy of Sciences(中国科学院大学);Beijing Institute of Technology(北京理工大学);Sun Yat-sen University(中山大学)
FourierGNN: Rethinking Multivariate Time Series Forecasting from a Pure Graph Perspective
Beijing Institute of Technology(北京理工大学);Tongji University(同济大学);University of Oxford(牛津大学);University of Macau(澳门大学);HeFei University of Technology(合肥工业大学);Macquarie University(麦考瑞大学)