Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 61 for “"Graph classification"”.

  1. Kernel Functions for Graph Classification

    Graphs are information-rich structures, but their complexity makes them difficult to analyze. Given their broad and powerful representation capacity, the classification of graphs has become an intense area of research. Many established classifiers represent objects with vectors of explicit …

    ku Repository record for Kernel Functions for Graph Classification (opens in a new tab)

  2. Graph Classification with Differential Privacy

    … are important may naturally be represented by graphs. Services may want to use machine learning algorithms to gain insight about their customers or users, and to successfully use the concepts of machine learning they must take the structure and properties of graph data into account. Seemingly …

    chalmers Repository record for Graph Classification with Differential Privacy (opens in a new tab)

  3. A controlled sensing approach to graph classification

    Graphs are used to model dependency structures, such as communication networks, social networks, and biological networks. Observing the graph in its entirety may be undesirable due to size of the graph or noise in observations, especially if only a function of the graph structure is of interest, …

    uiuc Repository record for A controlled sensing approach to graph classification (opens in a new tab)

  4. Graph Neural Networks for Bipartite Graphs

    Bipartite graphs are a special type of graph data structure where vertices can be divided into two disjoint and independent sets, and each edge connects a vertex from one set to a vertex in the other set. They can be used to model many real-world applications such as user-item interaction networks, …

    unsw Repository record for Graph Neural Networks for Bipartite Graphs (opens in a new tab)

  5. Real-time analytics for complex structure data

    … complex relationships are often represented as graphs to denote the content of the data entries and their structural relationships, where instances (nodes) are not only characterized by the content but are also subject to dependency relationships. Plus, real-time availability is one of …

    uts Repository record for Real-time analytics for complex structure data (opens in a new tab)

  6. Machine learning on graphs: algorithms and applications

    Graphs are well-studied structures which are utilized to model entities and their relationships. In recent years, graph-based representations have become ubiquitous in many application domains. For instance, in chemoinformatics graphs are used to capture the structure of molecules, while in natural …

    greece Repository record for Machine learning on graphs: algorithms and applications (opens in a new tab)

  7. Graph Deep Learning: Methods and Applications

    … intelligence, is changing everyone's life.Graph learning has been another hot field among the machine learning and data mining communities, which learns knowledge from graph-structured data. Examples of graph learning range from social network analysis such as community detection and link …

    wustl Repository record for Graph Deep Learning: Methods and Applications (opens in a new tab)

  8. Local inference of Morse indices using finite point samples

    … and wavelet signatures can be applied to graph classification problems in machine learning. We construct a supervised learning model which backpropagates through persistent homology to optimise over the space of wavelet signatures. We then apply this model to several benchmark graph …

    oxford Repository record for Local inference of Morse indices using finite point samples (opens in a new tab)

  9. Exploring Local Information for Graph Representation Learning

    Graphs are important data structures that can capture interactions between individual entities. The primitive graph representation is usually high-dimensional, sparse, noisy, and in irregular forms, which is challenging for direct usage in downstream tasks (e.g., node or graph classification). …

    whiterose Download PDF for Exploring Local Information for Graph Representation Learning (opens in a new tab)

  10. Learning from Structured Data with High Dimensional Structured Input and Output Domain

    … I have developed structured sparse boosting for graph classification, structured joint sparse PCA for anomaly detection and localization. Besides learning from structured input, I also investigated the interplay between structured input and output under the context of multi-task learning. In …

    ku Repository record for Learning from Structured Data with High Dimensional Structured Input and Output Domain (opens in a new tab)

  11. A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings

    Graph Neural Networks and Transformers are very powerful frameworks for learning machine learning tasks. While they were evolved separately in diverse fields, current research has revealed some similarities and links between them. This work focuses on bridging the gap between GNNs and Transformers …

    etsu Repository record for A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings (opens in a new tab) Download PDF for A Bridge between Graph Neural Networks and Transformers: Positional Encodings as Node Embeddings (opens in a new tab)

  12. Robust graph representation learning with structure-aware attention and self-supervised contrastive frameworks.

    Graph-structured data is pervasive across domains such as social networks, biological systems, and information networks, yet effectively learning from such data remains a fundamental challenge in machine learning. My dissertation focuses on developing novel graph representation learning methods …

    baylor Repository record for Robust graph representation learning with structure-aware attention and self-supervised contrastive frameworks. (opens in a new tab) Embargoed until 2028-08-15

  13. Scalable subgraph representation learning through simplification

    Link prediction on graphs is a fundamental problem. Subgraph representation learning approaches (SGRLs), by transforming link prediction to graph classification on the subgraphs around the links, have achieved state-of-the-art performance in link prediction. However, SGRLs are computationally …

    uoit Repository record for Scalable subgraph representation learning through simplification (opens in a new tab)

  14. Exploring Graph Neural Networks for Clustering and Classification

    Graph Neural Networks (GNNs) have become excessively popular and prominent deep learning techniques to analyze structural graph data for their ability to solve complex real-world problems. Because graphs provide an efficient approach to contriving abstract hypothetical concepts, modern research …

    iupui Repository record for Exploring Graph Neural Networks for Clustering and Classification (opens in a new tab)

  15. A generative model for latent position graphs

    … into machine learning methods applied to graph data. Most work is focused on performing either node classification or graph classification; however, there is much to be gained by learning instead a generative model for the underlying random graph distribution. We present a novel neural …

    jhu Repository record for A generative model for latent position graphs (opens in a new tab)

  16. Towards Graph Foundation Models: Few-shot and Zero-shot Learning on Graphs

    Graphs naturally model complex relationships and interactions across various domains, including social networks, biological systems, and recommender platforms. Graph Neural Networks (GNNs) have emerged as powerful tools for learning effective graph representations through iterative message passing, …

    wustl Repository record for Towards Graph Foundation Models: Few-shot and Zero-shot Learning on Graphs (opens in a new tab)

  17. Effective graph neural networks by overfitting and over-squashing mitigation

    Message-passing graph neural networks (MPNNs) are effective for graph learning tasks, yet their generalizability is limited by overfitting and over-squashing (exponential compression of long-range information from distant nodes). Methods that aim to improve generalization or expressiveness often …

    uoit Repository record for Effective graph neural networks by overfitting and over-squashing mitigation (opens in a new tab)

  18. Fast shortest-path kernel computations using aproximate methods

    … kernel is frequently seen in the context of graph classification, which shows up in various subjects, for example bioinformatics. However, it is not efficient enough to be applicable in practice if the graphs are too large. The purpose of this thesis is to explore the possibilities of …

    chalmers Repository record for Fast shortest-path kernel computations using aproximate methods (opens in a new tab)

  19. Subgraph classification through neighborhood pooling

    Subgraph classification is an emerging field in graph representation learning where the task is to classify a group of nodes (i.e., a subgraph) within a graph. Graph neural networks (GNNs) are the de facto solution for node, link, and graph-level tasks but fail to perform well on subgraph …

    uoit Repository record for Subgraph classification through neighborhood pooling (opens in a new tab)

  20. Accelerating large scale Graph Neural Network training using SmartSSD

    Graph Neural Network (GNN) is a type of neural network that processes data structured as graphs. It excels at capturing complex relationships and dependencies between nodes within the graph. GNNs are increasingly significant, with numerous applications in the real world, such as social network …

    bu Repository record for Accelerating large scale Graph Neural Network training using SmartSSD (opens in a new tab)

Page 1 of 4