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 11 of 11 for “"Frequent Subgraph Mining"”.
-
RiboFSM: Frequent Subgraph Mining for the Discovery of RNA Structures and Interactions
Frequent subgraph mining is a useful method for extracting biologically relevant patterns from a set of graphs or a single large graph. Here, the graph represents all possible RNA structures and interactions. Patterns that are significantly more frequent in this graph over a random graph are …
-
On Pattern Mining in Graph Data to Support Decision-Making
… of graph models for data integration and data mining of business data. Although a typical company's business data implicitly describes a graph it is usually stored in multiple relational databases. Therefore, we propose the first semi-automated approach to transform data from multiple …
-
Graph Theory for the Discovery of Non-Parametric Audio Objects
… areas of unsupervised learning algorithms and frequent subgraph mining methods. Tests are performed using a corpus of audio files spanning a wide range of sounds. Results show that the framework discovers new types of audio objects which yield average respective overall and relative compression …
-
Scalable Algorithms for Mining Maximal Quasi Frequent Subnetworks
Frequent graph mining has received considerable attention from researchers. Existing algorithms for frequent subgraph mining do not scale for large networks, and take hours to finish. Mining multiple gene coexpressions networks allows for identifying context-specific modules. Frequent subnetworks …
-
Design of Support Measures for Counting Frequent Patterns in Graphs
… popularity of graph datasets has grown rapidly. Frequent subgraph mining (FSM) from graphs becomes an important subject in computer science research. In this dissertation, we study single-graph as an effective model to represent information and its related graph mining techniques. In frequent …
-
Machine Learning to Analyze fMRI Brain Activity Recordings
… method on cortex parcels. Additionally, Graph Mining algorithms have been investigated with the achievement of binary classification. We applied a Frequent Subgraph Mining algorithm to mine the frequent subgraphs in a graph data set of brain activity and then achieved feature vectors to …
-
Efficient algorithms and system implementations for graph pattern matching
… and evolve over time, efficient algorithms for subgraph querying become critical. This thesis addresses three core problems in graph querying: subgraph isomorphism, frequent subgraph mining (FSM), and continuous subgraph matching, each of which is NP-complete and poses significant computational …
-
Optimizing algorithmic workloads and data structures for hardware accelerators
… the bioinformatics research area, the data mining domain and the graph mining domain.An important scientific area that combines both the big data processing and the complex data structures is the bioinformatics area. We focused on the gene finding problem, which uses the Hidden Markov Models …
-
API Usage Templates via Structural Generalization
… (APIs) are key in software development, but determining how to use one can be challenging. Developers often refer to a small set of API usage examples, analyzing the information in them to understand the API usage and adapting them to their own context. Generalization of these examples would aid …
-
Graph Kernels
… is constantly being generated, learning and data mining on graphs have become a challenge in application areas such as molecular biology, telecommunications, chemoinformatics, and social network analysis. The central algorithmic problem in these areas, measuring similarity of graphs, has therefore …
-
Semantics-aware image understanding
L'abstract è presente nell'allegato / the abstract is in the attachment