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 110 for “"Graph Clustering"”.
-
Topics in Graph Clustering
… or clusters can be recovered by spectral clustering algorithm with essentially the same guarantees. The model-based results, despite their importance, are limited by a strong and difficult-to-verify assumption that the observed data are generated from the model. We present the model-free …
-
Subgraph Density and Graph Clustering
Graph clustering, also often referred to as network community detection, is an unsupervised learning task. It is the process of grouping vertices into sets of vertices that share common relations. Graph clustering is a pivotal topic in the field of network science. It has applications in various …
-
Fast and Accurate Graph Clustering
Graph clustering, also known as community detection, is a fundamental problem in graph analytics with applications across a wide variety of domains including bioinformatics, social media analysis, and anomaly detection. Graph clustering algorithms can be grouped into two categories: inferential and …
-
Recovery Guarantees for Graph Clustering Problems
Graph clustering is widely-studied unsupervised learning problem in which the task is to group similar entities together based on observed pairwise entity interactions. This problem has applications in diverse domains such as social network analysis and computational biology. There are multiple …
-
Multiobjective graph clustering with variable neighbourhood descent
Graph clustering is a well-known combinatorial problem that appears in many different incarnations. The task is to partition the vertex set of a graph in order to minimize a given cost function. Clustering has applications in VLSI design, protein-protein interaction networks, data mining and many …
-
Local Graph Clustering Using l1-regularized PageRank Algorithms
Local graph clustering methods are used to find small- and medium-scale clusters without traversing the graph. It has been shown that the combination of Approximate Personalized PageRank (APPR) algorithm and sweep method can efficiently detect a small cluster around the starting vertex. This …
-
A Polymorphic Ant-Based Algorithm for Graph Clustering
… I introduce two new algorithms: Ant Brood Clustering-Intelligent Ants (ABC-INTE) and Ant Brood Clustering-Polymorphic Ants (ABC-POLY) for the graph clustering problem. ABC-INTE uses techniques such as hopping ants, relaxed drop function, ants with memories, stagnation control, and addition …
-
Improving robustness of DNS graph clustering against noise
Clustering is often the first step performed to assist us in finding structure within unlabeled datasets. Given a small set of labels, clustering also enables us to propagate these labels by discovering groups of objects that are similar to each other. The ever-growing amount of data being …
-
NemoCluster: Graph Clustering Algorithm for Structural Variant Detection
… in structural variant discovery is the use of clustering to detect anomalous regions in the genome. Well known tools such as DELLY use this approach to achieve high accuracy, however, no tools use a network-motif based clustering algorithm. The idea of anomalous genomic regions can be likened …
-
Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
… involve the study of statistical inference on graphs. Our problem of interest is to cluster the vertices of a graph by identifying its underlying community structure. Among various vertex clustering approaches, spectral clustering is one of the most popular clustering methods because it is easy …
-
Deep Graph Representation Learning and its Application on Graph Clustering
Graphs like social networks, molecular graphs, and traffic networks are everywhere in the real world. Deep Graph Representation Learning (DGL) is essential for most graph applications, such as Graph Classification, Link Prediction, and Community Detection. DGL has made significant progress in …
-
Efficient modularity density heuristics in graph clustering and their applications
Modularity Density Maximization is a graph clustering problem which avoids the resolution limit degeneracy of the Modularity Maximization problem. This thesis aims at solving larger instances than current Modularity Density heuristics do, and show how close the obtained solutions are to the …
-
On Graph Clustering or Community Detection: A Characteristic Analysis and Its Implications
<p>Graphs or networks represent relational data in an abstract and unifying form in terms of vertices and edges. Graph clustering in graph study language, or community detection in network science and engineering language, is fundamental to exploratory analysis of relational data, at different …
-
Efficient Algorithms for Constrained Graph Clustering with Applications in Epidemic Control and Fairness
Graph clustering is a fundamental problem with many applications in statistics, computer science, biology, and social science. Although classical graph clustering algorithms are well-studied, effective solutions in practice often require incorporating prior knowledge as constraints. For instance, …
-
Using Graph Clustering to Analyze the Spread of an Infectious Disease on a Random Large Social Network Graph
… disease on a random large social network graph. The goal is to determine if graph clustering techniques are a viable option to reduce workload of analyzing of a large data set. A random graph generator was developed using characteristics from the Forest Fire Model. We then use this graph …
-
A Survey of Clustering Analysis and Clustering Analysis in Graphs
Clustering analysis is an important topic in data mining, where data points that are similar to each other are grouped together. Graph clustering deals with clustering analysis of data points that correspond to vertices on a graph. We first survey some most well known algorithms for clustering …
-
Scalable Parallel Community Detection for Large-Scale Graphs
Community detection, also named as graph clustering, is essential to various graph analysis applications and can help researchers in a wide range of fields gain deep insights of graphs. However, in the era of big data, a large-scale graph containing billions or trillions of vertices and edges is …
-
Αναγνώριση κοινοτήτων σε τόπους του παγκόσμιου ιστού
Clustering is an important issue in the analysis and exploration of data. There is a wide area of clustering applications including information retrieval, image segmentation, character recognition, VLSI design, computer graphics and gene analysis. In particular, applications of graph-clustering …
-
Graphs, Clustering and applications
<P>GRAPHS ARE IMPORTANT DATA STRUCTURES IN AREAS SUCH AS DATA MINING, NATURAL LANGUAGE PROCESSING, INFORMATION RETRIEVAL, AND EXTRACTION. GRAPHS CAN BE USED TO MODEL PAIRWISE RELATIONS BETWEEN OBJECTS. IN CLUSTERING, SIMILARITIES BETWEEN OBJECTS TO BE CLUSTERED CAN BE EXPRESSED AS A WEIGHTED GRAPH …
-
Biological Networks: Modeling and Structural Analysis
… For protein complex networks, we propose a hypergraph model which more accurately represents the data than earlier models. We define the concept of k-cores in hypergraphs, which are highly connected subhypergraphs, and design an algorithm for computing k -cores in hypergraphs. A major challenge …
Page 1 of 6