Graph-Informed Neural Networks for Regressions on Graph-Structured Data
نویسندگان
چکیده
In this work, we extend the formulation of spatial-based graph convolutional networks with a new architecture, called graph-informed neural network (GINN). This architecture is specifically designed for regression tasks on graph-structured data that are not suitable well-known networks, such as functions domain and codomain defined two sets values vertices graph. particular, formulate (GI) layer exploits adjacent matrix given to define unit connections in describing convolution operation inputs associated We study GINN models respect maximum-flow test problems stochastic flow networks. GINNs show very good abilities interesting potentialities. Moreover, conclude by real-world application flux problem underground fractures.
منابع مشابه
Deep Convolutional Networks on Graph-Structured Data
Deep Learning’s recent successes have mostly relied on Convolutional Networks, which exploit fundamental statistical properties of images, sounds and video data: the local stationarity and multi-scale compositional structure, that allows expressing long range interactions in terms of shorter, localized interactions. However, there exist other important examples, such as text documents or bioinf...
متن کاملA Generalization of Convolutional Neural Networks to Graph-Structured Data
This paper introduces a generalization of Convolutional Neural Networks (CNNs) from low-dimensional grid data, such as images, to graph-structured data. We propose a novel spatial convolution utilizing a random walk to uncover the relations within the input, analogous to the way the standard convolution uses the spatial neighborhood of a pixel on the grid. The convolution has an intuitive inter...
متن کاملQuerying Graph Structured Data
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collected from many disparate sources on the Web. In particular, we study distributed indexing methods for graphstructured data and parallel query evaluation methods on a cluster of computers. We evaluate the system on a data...
متن کاملExtension of Graph-Based Induction for General Graph Structured Data
A machine learning technique called Graph-Based Induction (GBI) e ciently extracts typical patterns from directed graph data by stepwise pair expansion (pairwise chunking). In this paper, we expand the capability of the Graph-Based Induction to handle not only tree structured data but also multi-inputs/outputs nodes and loop structure (including a self-loop) which cannot be treated in the conve...
متن کاملLink Prediction Based on Graph Neural Networks
Traditional methods for link prediction can be categorized into three main types: graph structure feature-based, latent feature-based, and explicit feature-based. Graph structure feature methods leverage some handcrafted node proximity scores, e.g., common neighbors, to estimate the likelihood of links. Latent feature methods rely on factorizing networks’ matrix representations to learn an embe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10050786