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 4 of 4 for “"Graphic methods -- Data processing."”.

  1. Mining Quasi-Frequent Subnetworks in Graph Networks Using Edge-Edge Summary Graph

    In today’s computing world, graphs have become increasingly important in modeling sophisticated structures, entities and their interactions, with broad applications including Bioinformatics, Computer Vision, Web analysis etc. For an example, multiple gene expressions samples over the same set of …

    ndsu Repository record for Mining Quasi-Frequent Subnetworks in Graph Networks Using Edge-Edge Summary Graph (opens in a new tab)

  2. Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data

    … metrics to better characterize graph-structured data. It focuses on enhancing the analysis of graph-structured data and enhancing the explainability and power of Graph Neural Networks (GNNs) without introducing a new model architecture. Within existing GNN research, strong claims of …

    umkc Repository record for Weisfeiler-Leman graph kernels for the out-of-distribution characterization of graph structured data (opens in a new tab)

  3. Interactive pattern mining of neuroscience data

    … in terms of time when compared with exhaustive methods like FP Growth using RapidMiner tool. Instead of mining all frequent patterns, all of which may not be interesting to user, interactive method to mine only desired and interesting patterns is far better approach in terms of utilization of …

    iupui Repository record for Interactive pattern mining of neuroscience data (opens in a new tab)