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 22 for “"Dense subgraphs"”.

  1. Mining Representative Cohesive Dense Subgraphs

    … for solving this problem involves finding densely connected interacting members such as bound proteins in a PPI. It's important to also consider the properties of members. In the context of social networks, we might be interested in finding groups of friends of similar age and sharing …

    ndsu Repository record for Mining Representative Cohesive Dense Subgraphs (opens in a new tab)

  2. Large-Scale Mining of Dense Subgraphs: Algorithms and Systems

    Quasi-cliques and k-plexes are dense structures with established significance in graph mining, offering flexibility and resilience to data anomalies. However, mining these structures poses computational challenges due to their NP-hardness. In this study, we address these challenges and propose …

    uab Repository record for Large-Scale Mining of Dense Subgraphs: Algorithms and Systems (opens in a new tab)

  3. The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques

    The GapDensest-k-Subgraph(d) problem (GapDkS(d)) is defined as follows: given a graph G and parameters k,d, distinguish between the case that G contains a k-clique, and the case that every k-subgraph of G has density at most d. GapDkS(d) is a natural relaxation of the standard Clique problem, which …

    waterloo Repository record for The Complexity of Finding Dense Subgraphs in Graphs with Large Cliques (opens in a new tab)

  4. Bipartite Density: From Mixing Time to Local Algorithms for Dense Subgraphs

    … the local algorithmic approach to finding dense subgraphs and show that it can be sharpened and extended considerably. (1) We improve Andersen's bicriteria approximation algorithms for finding dense bipartite subgraphs, both in approximation ratio and in output size. Our result can be …

    waterloo Repository record for Bipartite Density: From Mixing Time to Local Algorithms for Dense Subgraphs (opens in a new tab)

  5. Mining Communities from Multi-Layered Graphs

    … graphs to represent networks and identifying dense subgraphs as communities within these graphs is an increasingly important area of study. Many of the same entities can be found in multiple networks, each representing a different type of relationship. These graphs capturing different …

    ndsu Repository record for Mining Communities from Multi-Layered Graphs (opens in a new tab)

  6. Dense subgraph detection on multi-layered networks

    Dense subgraph detection is a fundamental building block for a variety of applications. Most of the existing methods aim to discover dense subgraphs within a single network, or within a multi-view network consisting of a common set of nodes. However, many real-world applications can be better …

    uiuc Repository record for Dense subgraph detection on multi-layered networks (opens in a new tab)

  7. Unstable Communities in Network Ensembles

    … is usually formulated as one of computing dense subgraphs (communities) that are frequent, i.e., appear in many graphs in the ensemble. In this thesis, we seek to find "unstable communities" which are the antithesis of frequent, dense subgraphs. Informally, an unstable community is a set of …

    vt Repository record for Unstable Communities in Network Ensembles (opens in a new tab)

  8. Finding the Densest Common Subgraph with Linear Programming

    This thesis studies the concept of dense subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. This LP was originally created by Moses Charikar for a single graph and extended …

    chalmers Repository record for Finding the Densest Common Subgraph with Linear Programming (opens in a new tab)

  9. Truss decomposition in large probabilistic graphs

    … in graph mining, which focuses on discovering dense subgraphs of a graph. Detecting trusses in deterministic graphs is extensively studied in the literature. As most of the real-world graphs, such as social, biological, and communication networks, are associated with uncertainty, it is of great …

    uvic Repository record for Truss decomposition in large probabilistic graphs (opens in a new tab)

  10. Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction

    … in recovering clusters, biclusters, and dense subgraphs from large, sparse, and noisy networks. These structures are fundamental to social network analysis, genomics, and drug–target interaction prediction. Two optimization-based frameworks are developed for unsupervised structure …

    alabama Repository record for Convex and Non-Convex Relaxations for Densest Subgraph and Submatrix Recovery: Theory and Applications in Community Detection and Drug-Target Prediction (opens in a new tab)

  11. Learning COVID-19 network from literature databases using core decomposition

    … on the extended network and identify dense subgraphs. We then evaluate the identified dense subgraph and the generated hypotheses in three contexts: literature validation for uncovered virus targeting genes and proteins, gene function enrichment analysis on subgraphs, and literature …

    uvic Repository record for Learning COVID-19 network from literature databases using core decomposition (opens in a new tab)

  12. Graph-Theoretical Tools for the Analysis of Complex Networks

    … the problems of interest, such as finding dense subgraphs, are often the most difficult to solve from a computational point of view. Together, these issues motivate the need for novel algorithmic techniques in the study of graphs derived from large, complex, data sources. This dissertation …

    utk-theses Repository record for Graph-Theoretical Tools for the Analysis of Complex Networks (opens in a new tab)

  13. Dense subgraph mining in probabilistic graphs

    … we consider the problem of mining cohesive (dense) subgraphs in probabilistic graphs, where each edge has a probability of existence. Mining probabilistic graphs has become the focus of interest in analyzing many real-world datasets, such as social, trust, communication, and biological …

    uvic Repository record for Dense subgraph mining in probabilistic graphs (opens in a new tab)

  14. On designing structure-aware high-performance graph algorithms

    … Multiplication graph algorithms by extracting dense subgraphs containing incoming edges to in-hubs and processing them in the push direction, and (iii) the LOTUS algorithm that optimizes locality in Triangle Counting by separating different caching demands and deploying specific data structure …

    qu-belfast Repository record for On designing structure-aware high-performance graph algorithms (opens in a new tab) Download PDF for On designing structure-aware high-performance graph algorithms (opens in a new tab)

  15. Machine learning methods for community detection in networks using known community information

    … work on the assumption that communities are dense subgraphs in a network - which is not always true. Also, many community detection algorithms are in-memory and serial and do not scale to large networks. In this dissertation, we use knowledge from communities, including rich features from …

    texas Repository record for Machine learning methods for community detection in networks using known community information (opens in a new tab)

  16. Detection of Significantly Perturbed Subnetworks in Cancer

    … and minimizing conductance scores to find dense subgraphs around seed genes. To address computational issues, several novel algorithmic strategies are also developed. A large-scale benchmark study was performed on both simulation and cancer data. FDRnet significantly outperformed existing …

    buffalo Repository record for Detection of Significantly Perturbed Subnetworks in Cancer (opens in a new tab)

  17. Methods, algorithms and impossibility results for machine learning on graphs

    … edge-diverse and rich in small-sized dense subgraphs. We show the limitations of edge independent graph generative models and develop a hierarchy of models that are progressively more powerful in terms of mimicking better real-world networks. We complement our analysis with simple …

    bu Repository record for Methods, algorithms and impossibility results for machine learning on graphs (opens in a new tab)

  18. Numerical linear algebra techniques for effective data analysis.

    … blocking algorithm for reordering and finding dense diagonal blocks of a sparse matrix is adapted, to identify dense subgraphs of a sparse graph, with broad applications in community detection for social, biological and information networks. Finally, in the fourth scenario, we visit the …

    umn Repository record for Numerical linear algebra techniques for effective data analysis. (opens in a new tab)

  19. Information-theoretic graph mining

    … mining approaches that focus on discovering dense subgraphs, a novel graph mining technique CXprime (Compression-based eXploiting Primitives) is proposed. It models the transitivity and the hubness of a graph using structure primitives (all possible three-node substructures). Under the coding …

    lmu-germany Repository record for Information-theoretic graph mining (opens in a new tab)

  20. Dense graph pattern mining and visualization

    … most research attention, and it is called the dense subgraphs. A dense subgraph (pattern) is one class of critical information within a graph that represents a high level of interactions among entities. Such high level of interactions in many applications implies outstanding level of …

    nus Repository record for Dense graph pattern mining and visualization (opens in a new tab) Download file for Dense graph pattern mining and visualization (opens in a new tab)

Page 1 of 2