Learning with Graph Structures and Neural Networks
Creators: name: Wu, Yuexin
Publisher: name: Carnegie Mellon University
Year: 2022
Subjects: subject: 80109 Pattern Recognition and Data Mining
subject: FOS: Computer and information sciences

description: Graph-based learning focuses on the modeling of graphically structured data. Significant applications include the analysis of chemical compounds based on molecular structures, the prediction of solar-energy farm outputs based on radiation sensor network data, the forecasting of epidemiology outbreaks based on geographical relations among cities and social network interactions and so on. Algorithms for graphbased learning have been developed rapidly, addressing the following fundamental challenges: To encode the rich information about each individual node and node combinations in a graph, a.k.a. the<em> graph-based representation learning </em>challenge; To recover missing edges when graphs are only partially observed, a.k.a. the <em>graph completion</em> challenge; To leverage active learning in graphical settings when labeled nodes are highly sparse, a.k.a. the <em>label sparse</em> challenge; To enhance the tractability of training and inference over very large graphs, a.k.a. the <em>scaling </em>challenge. This thesis aims to enhance graph-based machine learning from all the above aspects via the following key contributions: <strong>Graph convolutional matrix factorization for bipartite edge prediction</strong>: For a specific category of graphs, i.e. bipartite graphs, traditional matrix factorization methods could not effectively leverage side information such as similarity measurements within the two groups of nodes. We, therefore, propose to use graph convolutions to enhance the learned factorized representations with the structured side information for better prediction accuracy. <strong>Using Graph Neural Networks (GNNs) for general edge prediction</strong>: While GNNs have had a great success in node classification, their application to edge prediction has not archived a matching level of performance. A possible interpretation for such an phenomena is that the latent embeddings in GNNs heavily rely on the input node features and that if those input features are not of good quality, or rather noisy for the prediction tasks on hand, then sub-optimal performance would not be avoidable. We propose to address this issue by a combined use of a traditional GNN and the Transformer model which yields improved embedding of notes via flexible positional embeddings in the Transformer model. <strong>Graph-enhanced Active Learning (Graph-AL) for node classification</strong>: Active learning has been intensively studied for addressing the label sparse issue and successfully applied in text/video/audio data but not graphs. Popular AL strategies may not be directly applicable to graphs. For example, density-based document selection treats all the candidate documents as unrelated instances, ignoring the dependency structures among nodes in the input graph. We propose the first graph-based active learning approach which is tailored for Graph Neural Networks, which takes both node-internal features and cross-node connections into account for node selection in AL. <strong>Various real-world applications of large-scale graph-based learning</strong>: We have applied graph-based learning to a variety of real-world problems, including multi-graph based collaborative filtering, graph-based transfer learning across languages, graph-based deep learning for epidemiology prediction, graph-enhanced node classification, edge detection and knowledge base completion; we obtained the state-of-the-art results in each of those domains at the times. (Chang et al., 2017; Liu et al., 2017a; Wu et al., 2018b,c; Xu et al., 2018b).