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 28 for “"massive graphs"”.
-
Computing Paths in Massive Graphs
… play an important role in the processing of graphs, and path queries are one of the most important types of query operations on graphs. A path query attempts to retrieve the path from one vertex to another, and has numerous real-world applications. Given the importance of path queries in …
-
Scalable analytics of massive graphs
Graphs are commonly selected as a model of scientific information: graphs can successfully represent imprecise, uncertain, noisy data; and graph theory has a well-developed mathematical apparatus forming a solid and sound foundation for graph research. Design and experimental confirmation of new, …
-
Mining Small Subgraphs in Massive Graphs
… problems require that we find and locate all subgraphs of specific patterns within a given graph. This task is not trivial when we are dealing with massive graphs, of millions or even billions of nodes and edges. In particular, it becomes harder when we want to get it done within a limited time, …
-
Fair and Scalable Algorithms on Massive Graphs
The impact of massive data processing on our daily lives is becoming increasingly more clear. With this, we must guarantee that vital, data-driven decision-making systems mitigate the potential negative impacts of the technologies themselves and scale to the massive datasets we have access to …
-
EFFICIENT SUBGRAPH MINING AND DISCOVERY ON MASSIVE GRAPHS
… attribute-based modularity for billion-scale graphs, delivering superior accuracy and runtime efficiency. Together, these contributions advance the field by providing scalable, temporal-aware, and attribute-enhanced techniques for modern graph analytics.
-
Analyzing Massive Graphs in the Semi-streaming Model
Massive graphs arise in a many scenarios, for example, traffic data analysis in large networks, large scale scientific experiments, and clustering of large data sets. The semi-streaming model was proposed for processing massive graphs. In the semi-streaming model, we have a random accessible memory …
-
Exploring Shortest Path-Based Queries on Massive Graphs
… and shortest cycle counting queries on dynamic graphs, as well as top-k nearest neighbor (kNN) search in public transportation networks. The first study explores the problem of counting shortest paths on dynamic graphs, a critical component for applications such as friend recommendation and …
-
Efficient Path Enumeration and Structural Clustering on Massive Graphs
… particularly in the context of billion-scale graphs. We first explore the problem of HC-s-t path enumeration. Existing solutions for this problem often suffer from inefficiency and scalability limitations, especially when dealing with billion-scale graphs. To overcome these drawbacks, we …
-
Efficient and Scalable Graph Pattern Matching on Massive Graphs
The past decade has witnessed the emergence of massive graph data. Graph is an important data structure containing vertices and edges that can be used to model complex relationships among entities in real-life applications. In this thesis, we study the fundamental problem of graph pattern matching …
-
Efficient and Scalable Listing of Four-Vertex Subgraph
Identifying four-vertex subgraphs has long been recognized as a fundamental technique in bioinformatics and social networks. However, listing these structures is a challenging task, especially for graphs that do not fit in RAM. To address this problem, we build a set of algorithms, models, and …
-
Scaling Up Structural Clustering to Large Probabilistic Graphs Using Lyapunov Central Limit Theorem
… focus on structural clustering of probabilistic graphs, which comes with significant computational challenges and has, so far, resisted efficient solutions that are able to scale to large graphs, e.g. state-of-art can only handle graphs with a few million edges. We address the main bottleneck …
-
Approximating 4-cliques in streaming graphs: the power of dual sampling
… is a combinatorial explosion; even moderate graphs with a few million edges could have clique counts in the order of many billions. When dealing with such big data, it becomes critical to not just analyze it, rather analyze it very efficiently. While randomized algorithms are known for …
-
Fast and scalable triangle counting in graph streams: the hybrid approach
… Probability (FP) approach. As the size of the graphs grows, several challenges arise such as memory space limitations, and prohibitively long running time. Therefore, both FM and FP categories exhibit some limitations. FP algorithms fail to scale for massive graphs. We identified a limitation …
-
Mining dense substructures from large deterministic and probabilistic graphs
<p>Graphs represent relationships. Some relationships can be represented as a deterministic graph while others can only be represented by using probabilities. Mining dense structures from graphs help us to find useful patterns in these relationships having applications in wide areas like social …
-
Community Detection using Locality Statistics
… identifying an anomalous community in temporal graphs and another method of identifying active communities in a static massive graph. All methods are based on locality statistics. In [50], an anomalous community is detected that shows growing connectivities in a time series of graphs. We …
-
Scalable Algorithm Design and Performance Analysis for Graph Motifs Discovery
… a remarkable speedup ranging from 20x to 55x for massive graphs with millions of vertices and billions of edges.
-
CUTTANA : scalable graph partitioning for faster distributed graph databases and analytics
… time, worker imbalance, and network overhead. Graphs that require distributed settings are often too large to fit in the main memory of a single machine. This challenge renders traditional in-memory graph partitioners infeasible, leading to the emergence of streaming solutions. Streaming …
-
Computational Perspectives On Large-Scale Social Networks
… both geographic and network structures of social graphs not necessarily found in other graph contexts. Additional work presents a highly scalable "restreaming" approach to partitioning massive graphs with rich local structure. Lastly, work on interference in online experiments (A/B tests) offers a …
-
A multi-scale framework for graph based machine learning problems
… contributor of the recent Big Data trend, the massive scale of graphs in modern machine learning problems easily overwhelms existing methods and thus sophisticated scalable algorithms are needed for real-world applications. In this thesis, we develop a novel multi-scale framework based on the …
-
Finding Dense Regions of Rapidly Changing Graphs
Many of today's massive and rapidly changing graphs contain internal structure---hierarchies of locally dense regions---and finding and tracking this structure is key to detecting emerging behavior, exposing internal activity, summarizing for downstream tasks, identifying important regions, and …
Page 1 of 2