Structure and inference in hypergraphs with node attributes

• URL: http://arxiv.org/abs/2311.03857v2
• Date: Wed, 30 Oct 2024 08:49:15 GMT
• Title: Structure and inference in hypergraphs with node attributes
• Authors: Anna Badalyan, Nicolò Ruggeri, Caterina De Bacco,
• Abstract summary: We show how node attributes can be used to improve our understanding of the structure resulting from higher-order interactions. We develop a principled model that combines higher-order interactions and node attributes to better represent the observed interactions.
• Score: 1.024113475677323
• License:
• Abstract: Many networked datasets with units interacting in groups of two or more, encoded with hypergraphs, are accompanied by extra information about nodes, such as the role of an individual in a workplace. Here we show how these node attributes can be used to improve our understanding of the structure resulting from higher-order interactions. We consider the problem of community detection in hypergraphs and develop a principled model that combines higher-order interactions and node attributes to better represent the observed interactions and to detect communities more accurately than using either of these types of information alone. The method learns automatically from the input data the extent to which structure and attributes contribute to explain the data, down weighing or discarding attributes if not informative. Our algorithmic implementation is efficient and scales to large hypergraphs and interactions of large numbers of units. We apply our method to a variety of systems, showing strong performance in hyperedge prediction tasks and in selecting community divisions that correlate with attributes when these are informative, but discarding them otherwise. Our approach illustrates the advantage of using informative node attributes when available with higher-order data.

Related papers

• Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation [66.40525136929398]
  Test-time adaptation (TTA) has attracted attention due to its ability to adapt a pre-trained model to a target domain, without re-accessing the source domain. We propose Matcha, an innovative framework designed for effective and efficient adaptation to structure shifts in graphs. We validate the effectiveness of Matcha on both synthetic and real-world datasets, demonstrating its robustness across various combinations of structure and attribute shifts.
  arXiv  Detail & Related papers  (2024-10-09T15:15:40Z)
• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• Distributed Learning over Networks with Graph-Attention-Based Personalization [49.90052709285814]
  We propose a graph-based personalized algorithm (GATTA) for distributed deep learning. In particular, the personalized model in each agent is composed of a global part and a node-specific part. By treating each agent as one node in a graph the node-specific parameters as its features, the benefits of the graph attention mechanism can be inherited.
  arXiv  Detail & Related papers  (2023-05-22T13:48:30Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Adaptive Neural Message Passing for Inductive Learning on Hypergraphs [21.606287447052757]
  We present HyperMSG, a novel hypergraph learning framework. It adapts to the data and task by learning an attention weight associated with each node's degree centrality. It is robust and outperforms state-of-the-art hypergraph learning methods on a wide range of tasks and datasets.
  arXiv  Detail & Related papers  (2021-09-22T12:24:02Z)
• Pair-view Unsupervised Graph Representation Learning [2.8650714782703366]
  Low-dimension graph embeddings have proved extremely useful in various downstream tasks in large graphs. This paper pro-poses PairE, a solution to use "pair", a higher level unit than a "node" as the core for graph embeddings. Experiment results show that PairE consistently outperforms the state of baselines in all four downstream tasks.
  arXiv  Detail & Related papers  (2020-12-11T04:09:47Z)
• Node Attribute Completion in Knowledge Graphs with Multi-Relational Propagation [14.58440933068]
  Our approach, denoted as MrAP, imputes the values of missing attributes by propagating information across a knowledge graph. It employs regression functions for predicting one node attribute from another depending on the relationship between the nodes and the type of the attributes.
  arXiv  Detail & Related papers  (2020-11-10T18:36:33Z)
• Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning [12.592903558338444]
  We propose a graph representation learning method called Graph InfoClust. It seeks to additionally capture cluster-level information content. This optimization leads the node representations to capture richer information and nodal interactions, which improves their quality.
  arXiv  Detail & Related papers  (2020-09-15T09:33:20Z)
• Joint Item Recommendation and Attribute Inference: An Adaptive Graph Convolutional Network Approach [61.2786065744784]
  In recommender systems, users and items are associated with attributes, and users show preferences to items. As annotating user (item) attributes is a labor intensive task, the attribute values are often incomplete with many missing attribute values. We propose an Adaptive Graph Convolutional Network (AGCN) approach for joint item recommendation and attribute inference.
  arXiv  Detail & Related papers  (2020-05-25T10:50:01Z)
• Predicting Attributes of Nodes Using Network Structure [0.34998703934432673]
  We propose an approach to represent a node by a feature map with respect to an attribute $a_i$ using all attributes of neighbors to predict attributes values for $a_i$. We perform extensive experimentation on ten real-world datasets and show that the proposed feature map significantly improves the prediction accuracy as compared to baseline approaches on these datasets.
  arXiv  Detail & Related papers  (2019-12-27T17:59:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.