graph-level problem
subject:: Data Science Methods for Large Scale Graphs
parent:: Graph Signals and Graph Signal Processing
theme:: math notes
In graph-level problems, there are multiple graphs. Each graph
Here, our hypothesis class is
Since there are no graph signal observations, we use the vector of all ones
And our minimization problem is given by $$\min_{h_{k}} \frac{1}{m} \sum_{i=1}^M \ell\left( \sum_{k=0}^{K-1} h_{k} S^k \mathbb{1}, y \right)$$
Suppose we want to predict the number of triangles incident to each node for any graph
In this example, since our output is an integer, it mades sense to use the
Application: automate triangle counting