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 15 of 15 for “"graph summarization"”.

  1. Probabilistic graph summarization

    We study group-summarization of probabilistic graphs that naturally arise in social networks, semistructured data, and other applications. Our proposed framework groups the nodes and edges of the graph based on a user selected set of node attributes. We present methods to compute useful graph …

    uvic Repository record for Probabilistic graph summarization (opens in a new tab)

  2. Efficient Graph Summarization of Large Networks

    In this thesis, we study the notion of graph summarization, which is a fundamental task of finding a compact representation of the original graph called the summary. Graph summarization can be used for reducing the footprint of the input graph, better visualization, anonymizing the identity of …

    uvic Repository record for Efficient Graph Summarization of Large Networks (opens in a new tab)

  3. Mining Subgraphs and Summaries from Large Networks

    Graphs can abstract the relationships between entities in various applications, such as social science, biology, and web links. Nowadays, large-scale graphs have become ubiquitous in different domains. To analyze a network, cohesive subgraph mining finds densely connected subgraphs, while graph …

    unsw Repository record for Mining Subgraphs and Summaries from Large Networks (opens in a new tab)

  4. Low latency data retrieval solutions for big data

    … propose an Intelligent Caching technique and a Graph Summarization technique in order to achieve low latency data retrieval for big data based applications. Our caching approach is developed on top of HDFS to optimize the read latency of HDFS. HDFS is primarily suitable for Write Once Read Many …

    uiuc Repository record for Low latency data retrieval solutions for big data (opens in a new tab)

  5. Translational bioinformatics for personalized medicine and integrative biology: Data integration, extraction, knowledge discovery, and visualization

    … thesis are: a) development of novel full-text summarization algorithms that have been incorporated into a web application (CoReViz) for visualizing clinically relevant information and extracting relevant sentences from clinical text and scientific articles; b) development of novel association …

    gatech Repository record for Translational bioinformatics for personalized medicine and integrative biology: Data integration, extraction, knowledge discovery, and visualization (opens in a new tab)

  6. AI-Enabled Framework for Log-Driven Detection and Attribution

    … converting unstructured records into parse-graphs of origin–target–activity relations, restoring cross-source context without raw-data pooling. Third, Behavioral Attribution performs graph-based threat modeling and attribution using graph attention networks and a two-level graph …

    guelph Repository record for AI-Enabled Framework for Log-Driven Detection and Attribution (opens in a new tab)

  7. On Ranked Approximate Matching Of Large Attributed Graphs

    … database applications entail sophisticated graph based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively …

    wayne-thes Repository record for On Ranked Approximate Matching Of Large Attributed Graphs (opens in a new tab)

  8. Algorithms to Explore the Structure and Evolution of Biological Networks

    … patterns and modules embedded in large graphs. The first, graph summarization, uses the minimum description length principle to find compressible parts of the graph. The second, VI-Cut, uses the variation of information to non-parametrically find groups of topologically cohesive and …

    maryland Repository record for Algorithms to Explore the Structure and Evolution of Biological Networks (opens in a new tab)

  9. Multi-purpose exploratory mining of complex data

    … range from high-dimensional feature spaces to graph data describing relationships among objects. Many techniques exist in the literature for mining simple numerical data but only a few approaches touch the increasing challenge of mining complex data, such as high-dimensional vectors of …

    lmu-germany Repository record for Multi-purpose exploratory mining of complex data (opens in a new tab)

  10. Provenance Management for Collaborative Data Science Workflows

    … adopt a schema-later approach and use a flexible graph-based provenance representation model that combines the core concepts in version control and provenance management. We describe several ingestion mechanisms for this provenance model and show how heterogeneous data analysis environments can be …

    maryland Repository record for Provenance Management for Collaborative Data Science Workflows (opens in a new tab)

  11. EXPLORING MULTIPLEX NETWORKS

    … networks, brain connectivity networks and web graphs are only some of the examples. As network theory evolves it becomes more apparent that these complex systems are often composed of multiple types of interactions, each carrying a different piece of information, and therefore are commonly …

    temple Repository record for EXPLORING MULTIPLEX NETWORKS (opens in a new tab)

  12. Information-theoretic graph mining

    … various application domains can be modeled as a graph, e.g. social networks and biomedical networks like protein interaction networks or co-activation networks of brain regions. A graph is a powerful concept to model arbitrary (structural) relationships among objects. In recent years, the …

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

  13. OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS

    … analytics problems: machine learning models and graph algorithms We focus on three cases: the product of a matrix by its transposed, the powers of a square matrix and iteration of matrix-vector multiplication. Based on this foundation, we introduce important optimizations to the computation of …

    houston Repository record for OPTIMIZED ALGORITHMS FOR DATA ANALYSIS IN PARALLEL DATABASE SYSTEMS (opens in a new tab)

  14. Optimizing and Understanding Network Structure for Diffusion

    … epidemic can die out quickly, if vulnerable demographic groups are successfully targeted for vaccination. Hence in this thesis, we aim to optimize and understand network structure better in light of diffusion. We optimize graph topologies by removing nodes/edges for controlling rumors/viruses …

    vt Repository record for Optimizing and Understanding Network Structure for Diffusion (opens in a new tab)

  15. Domain-based Frameworks and Embeddings for Dynamics over Networks

    … the network structure and depend on the geography as well. Traditional approaches either rely on models like Susceptible Infectious (SI) and Independent Cascade (IC) which are too restrictive because they focus only on single pathways or do not incorporate the model at all, resulting in …

    vt Repository record for Domain-based Frameworks and Embeddings for Dynamics over Networks (opens in a new tab)