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 14 of 14 for “"Graph sampling"”.

  1. Online social networks: real-time graph sampling, multilayered information diffusion, and equality issues

    … our scientific contributions. Which are in; data sampling methods for online restrictive environments, inter-OSNs information propagation, OSN issues and future possibilities. The first section covers the issues of OSN real time sampling. Prior to the introduction of a novel sampling method, an …

    greece Repository record for Online social networks: real-time graph sampling, multilayered information diffusion, and equality issues (opens in a new tab)

  2. RaNT-GRAPH: Sampling One Hundred Billion Random Walks Using an Optimized Distributed Graph Data Structure

    Sampling random walks is an important element of many graph algorithms and has been applied to problems such as graph embedding, link prediction, and centrality ranking. With the increase in data resulting in large-scale graphs in a variety of domains, the need for performant walk sampling is …

    tamu Repository record for RaNT-GRAPH: Sampling One Hundred Billion Random Walks Using an Optimized Distributed Graph Data Structure (opens in a new tab)

  3. Graph mining In complex networks and prediction in the web graph

    … for their investigation gave prominence to the Graph Mining field which constitutes a very powerful tool of data representation (as graphs). Graphs have become very important in modeling complicated structures and analyzing the topological characteristics of large and complex networks and …

    greece Repository record for Graph mining In complex networks and prediction in the web graph (opens in a new tab)

  4. Graph Analysis on Social Networks

    … to information extraction. Especially for graph analysis, it needs to deal with not only the valuation of the vertices but also the connections between vertices, and how many connections each vertex can have. According to empirical experiments, the distributions of vertices, edges, and …

    usf Repository record for Graph Analysis on Social Networks (opens in a new tab)

  5. Towards trustworthy computing on social networks: measurements and new applications.

    … the expansion, and the betweenness in social graphs. We show that some of these properties do not hold, whereas others hold with less quality than assumed in the literature. From there, we propose to proceed to study these properties in different settings. We propose to study one of these …

    umn Repository record for Towards trustworthy computing on social networks: measurements and new applications. (opens in a new tab)

  6. Approximate failure recovery in distributed graph processing systems

    Distributed graph processing systems are an emerging area of big data systems. As graphs continue to grow in size and prevalence, these systems must become faster and more scalable. However, after failures, distributed graph processing systems either largely rely on proactive fault tolerance …

    uiuc Repository record for Approximate failure recovery in distributed graph processing systems (opens in a new tab)

  7. Pediatric Bone Age Analysis and Brain Disease Prediction for Computer-Aided Diagnosis

    … availability of largescale pediatric hand radiographs and brain imaging benchmarks has sparked a surge of interest in designing efficient techniques for bone age assessment and brain disease prediction, which are fundamental problems in computer-aided diagnosis. Bone age is an effective metric …

    concordia Download PDF for Pediatric Bone Age Analysis and Brain Disease Prediction for Computer-Aided Diagnosis (opens in a new tab)

  8. Composable Algorithms for Scalable GNN Dataloading

    Training Graph Neural Networks (GNNs) at a large scale requires significant computational resources. One of the most effective ways to reduce resource requirements is minibatch training coupled with graph sampling. Existing methods encounter a significant bottleneck to scaling due to the …

    gatech Repository record for Composable Algorithms for Scalable GNN Dataloading (opens in a new tab)

  9. Sampling of Random Graphs with Prescribed Degree Sequence

    Random graph generation is the foundation of the statistical study of complex networks, which are commonly found in social, technological, and biological systems. In empirical studies, often only limited information about the topological structure of a network is available. In order to make the …

    houston Repository record for Sampling of Random Graphs with Prescribed Degree Sequence (opens in a new tab)

  10. The Polyhedral Geometry of Graphical Designs

    A graphical design is a quadrature rule for a graph. That is, a graphical design is a subset of graph vertices for which the global averages of certain Laplacian eigenvectors are equal to weighted averages of these vectors over the design subset. This definition was inspired by classical quadrature …

    washington Repository record for The Polyhedral Geometry of Graphical Designs (opens in a new tab)

  11. Topics of statistical analysis with social media data

    … media data for statistical analysis and to the graph representation of these data that is generally available to the researcher and to its use for statistical inference.<br/><br/>Most of the literature about the use of social media data for statistical analysis is concerned with the fact that …

    soton Download PDF for Topics of statistical analysis with social media data (opens in a new tab)

  12. Efficient sampling from random web graph and its application

    … algorithms to sample from random web graphs generated by two important stochastic graph models based on concept of copying: the linear copy model and the hostgraph model. The goal is to avoid constructing the entire random graph, and instead use an amount of space nearer to the desired …

    uvic Repository record for Efficient sampling from random web graph and its application (opens in a new tab)

  13. Initial Solution Improvements to a Tethered Robotic Path Planner using Random Geometric Graph Configurations and Biased Sampling

    … the planner. The first biases the algorithm's sampling process to focus a portion of its approximation on sloped regions of the map, where the planner is expected to have more trouble finding a solution satisfying its stability constraints. The second re-configures the underlying Random …

    mtu Repository record for Initial Solution Improvements to a Tethered Robotic Path Planner using Random Geometric Graph Configurations and Biased Sampling (opens in a new tab)