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 17 of 17 for “"Graphlet"”.
-
Graphlet based network analysis
… of local topological structures of a network. Graphlets which are induced small subgraphs capture the local topological structure of a network effectively. They are becoming increasingly popular for characterizing large networks in recent years. Graphlet based network analysis can vary based on …
-
Improvements on ORCA for Fast Computation of Graphlet Degree Vectors of any Graphlet Order
… of each vertex of the given graphs. This is why graphlet degree vectors have become more and more popular in these areas. They provide a simple yet detailed representation of a vertex's topology by counting the number of times such vertex touches a list of small predefined sub-structures called …
-
Graphlet counting in massive networks
… of small subgraphs (also known as motifs or graphlets) is an effective tool to analyze complex networks. Graph motifs such as triangle (a cycle of size three), diamond (two triangles with one vertex in common), butterfly (a (2,2)-biclique), and $k$-clique (for $k \leq 6$) are indeed regarded …
-
Graphlet based network analysis of protein structures
… graph-based whole-residue empirical potential. Graphlets, a recently introduced and powerful concept in graph theory, are a fundamental aspect of this thesis. The topological similarity between protein structure networks or individual residues was assessed using graphlet-based methods in order …
-
Topological Network Alignment Based on Graphlet Degree Signature
… topological method of network alignment based on graphlet degree signatures, called GRAAL, which can be used to align any kind of networks not just biological ones. Several global network alignment algorithms also have been designed based on GRAAL, such as MI-GRAAL, H-GRAAL, and C-GRAAL. However, …
-
Network Alignment Using Topological and Node Embedding Features
… topology-based alignment task. The first work, Graphlet-based Alignment (Graphlet-Align), employs a topological approach to network alignment. Graphlet-Align represents each node with a local graphlet count based signature and use that as feature for deriving node to node similarity across a …
-
Selectivty Estimation on Big Data
… opportunities. Finally, we study the problem of graphlet statistics estimation. We propose high-order Markov chain based method to estimate the graphlet statistics. Our method HRWd performs high-order random walk via adjacent tensor with respect to a specified local structure. By collecting …
-
Exploiting Structure Information for Network Dissimilarity Characterization - Application to Disease Network Analysis and Treatment Prediction
… we introduce the notion of differential graphlet community to detect deregulated subgraphs between any graphs such that the network structure information is exploited. We observed a trend that the shortest path lengths are shorter for tumor graphs than for normal graphs between genes that …
-
Distributed enumeration of four node graphlets at quadrillion-scale
Graphlet enumeration is a basic task in graph analysis with many applications. Thus it is important to be able to perform this task within a reasonable amount of time. However, this objective is challenging when the input graph is very large, with millions of nodes and edges. Known solutions are …
-
Graph Classification with Differential Privacy
… known graph kernels, the random walk kernel and graphlet kernels. Furthermore, to allow for classification of large graphs we present a novel sampling scheme for approximation of subgraph counts. We evaluate both sampling and classification using four real world datasets consisting of social, …
-
Efficient analysis of local and global structures in large networks
… structure analysis tasks: (1) computation of graphlet distributions, (2) construction of triangle maps, and (3) detection of multilevel community structures. For Tasks 1 and 2, we have significantly reduced the complexities. We discover reusable or compressible structures adaptively and …
-
Parasitism, Predation Prediction: Modelling Variations in Ecological Interactions from Mechanisms to Networks
… framework of count-based inferential methods and graphlet-based techniques. I showed that for freshwater stream fish communities, the inclusion of juveniles – specifically larger species’ juveniles – fundamentally altered the structure of their interaction networks. Altogether, the findings in my …
-
Enumerating K-Cliques in a Large Network Using Apache Spark
… task, and examples include clique enumeration, graphlet counting, and motif counting. In this paper, my focus is to fi nd an efficient solution of k-clique enumeration problem. A clique is a small, connected, and complete induced subgraph over a large network. However, enumerating cliques using …
-
Adversarial Attacks and Defense Mechanisms to Improve Robustness of Deep Temporal Point Processes
… of real-world networks. We propose using the graphlet frequency distribution combined with assortativity to explain variations in the evolution of viral processes across networks with identical degree distribution. Using a data-driven approach, by coupling predictive modeling with viral …
-
Multilayer networks: phenomena, theory, and practice
… networks is progressed in the subject of graphlets, an essential tool in the investigation of the structure of networks. The mathematical concepts relating to graphlets and graphlet measures in multilayer networks are built bottom-up in a rigorous principled way, and their superiority over …
-
Graph analytics and subset selection problems in machine learning
… properties. This problem generalizes graphlet counting and has found applications ranging from bioinformatics to spam detection. Our algorithms use the novel concept of graph profile sparsifiers: sparse graphs that can be used to approximate the full profile counts for a given large …
-
Machine learning on graphs: algorithms and applications
… to derive variants of four graph kernels, namely graphlet kernel, shortest-path kernel, Weisfeiler-Lehman subtree kernel, and pyramid match graph kernel. The framework is not limited to graph kernels, but can be applied to any algorithm that compares pairs of graphs. The proposed framework is …