![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Benchmarking GNNs with GenCAT Workbench
We present GenCAT Workbench, an end-to-end framework with which users can generate synthetic attributed graphs with node labels and evaluate their graph analytic methods, e.g., graph neural networks (GNNs), on...
-
Chapter and Conference Paper
GNN Transformation Framework for Improving Efficiency and Scalability
We propose a framework that automatically transforms non-scalable GNNs into precomputation-based GNNs which are efficient and scalable for large-scale graphs. The advantages of our framework are two-fold; 1) i...
-
Chapter and Conference Paper
ReLOG: A Unified Framework for Relationship-Based Access Control over Graph Databases
Relationship-Based Access Control (ReBAC) is a paradigm to specify access constraints in terms of interpersonal relationships. To express these graph-like constraints, a variety of ReBAC models with varying fe...
-
Chapter and Conference Paper
Multi-strategy Differential Evolution
We propose the Multi-strategy Differential Evolution (MsDE) algorithm to construct and maintain a self-adaptive ensemble of search strategies while solving an optimization problem. The ensemble of strategies i...
-
Chapter and Conference Paper
Clustering-Structure Representative Sampling from Graph Streams
Most existing sampling algorithms on graphs (i.e., network-structured data) focus on sampling from memory-resident static graphs and assume the entire graphs are always available. However, the graphs encounter...