ILLC, University of Amsterdam(阿姆斯特丹大学逻辑、语言与计算研究所);IRIT, University of Toulouse(图卢兹大学信息与电信研究所);University of Toulouse(图卢兹大学);Paris-Dauphine University(巴黎第九大学);Pierre & Marie Curie University(皮埃尔和玛丽·居里大学);London School of Economics(伦敦政治经济学院)
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding the relationships between arguments in a debate (graphs as abstract argumentation frameworks), or when computing a consensus between several alternative clusterings of a given dataset (graphs as equivalence relations). In this paper, we introduce a formal framework for graph aggregation grounded in social choice theory. Our focus is on understanding which properties shared by the individual input graphs will transfer to the output graph returned by a given aggregation rule. We consider both common properties of graphs, such as transitivity and reflexivity, and arbitrary properties expressible in certain fragments of modal logic. Our results establish several connections between the types of properties preserved under aggregation and the choice-theoretic axioms satisfied by the rules used. The most important of these results is a powerful impossibility theorem that generalises Arrow's seminal result for the aggregation of preference orders to a large collection of different types of graphs.
RMNA: A Neighbor Aggregation-Based Knowledge Graph Representation Learning Model Using Rule Mining
College of Computer Science and Technology, Zhejiang University(浙江大学计算机科学与技术学院);School of Remote Sensing and Information Engineering, Wuhan University(武汉大学遥感信息工程学院)
AMA-GCN: Adaptive Multi-layer Aggregation Graph Convolutional Network for Disease Prediction
Zhengzhou University(郑州大学);Beihang University(北京航空航天大学);The First Affiliated Hospital of Zhengzhou University(郑州大学第一附属医院);Ningbo Huamei Hospital, University of the Chinese Academy of Sciences(中国科学院大学宁波华美医院)
A Federated Parameter Aggregation Method for Node Classification Tasks with Different Graph Network Structures
Institute of Cyberspace Security, Zhejiang University of Technology(浙江工业大学网络空间安全研究院);Binjiang Cyberspace Security Institute of ZJUT(浙江工业大学滨江网络空间安全研究院);College of Information Engineering, Zhejiang University of Technology(浙江工业大学信息工程学院)
Graph Neural Aggregation-diffusion with Metastability
Academy of Mathematics and Systems Science, Chinese Academy of Sciences(中国科学院数学与系统科学研究院);University of Chinese Academy of Sciences(中国科学院大学);School of Statistics and Data Science, Nankai University(南开大学统计与数据科学学院)
Sloan Kettering Institute(斯隆凯特琳研究所);Memorial Sloan Kettering Cancer Center(纪念斯隆凯特琳癌症中心);City College of New York(纽约城市学院);City University of New York(纽约城市大学);Facebook, Inc.(脸书公司)
Beyond the Aggregation Dilemma: Prior-Retaining Decoupled Learning for Multimodal Graphs
School of Computer Science and Engineering, Central South University(中南大学计算机科学与工程学院);Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University(香港理工大学数据科学与人工智能系);School of Information and Communication Technology, Griffith University(格里菲斯大学信息与通信技术学院)
Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing
School of Computer Science and Engineering, University of Electronic Science and Technology of China(电子科技大学计算机科学与工程学院);Michigan State University(密歇根州立大学);Alibaba Group(阿里巴巴集团)
Coded Robust Aggregation for Distributed Learning under Byzantine Attacks
Division of Information Science and Engineering, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology(信息科学与工程系,电气工程与计算机科学学院,皇家理工学院)