On structure preserving sampling and approximate partitioning of graphs.
Wouter van HeeswijkGeorge H. L. FletcherMykola PechenizkiyPublished in: SAC (2016)
Keyphrases
- structure preserving
- graph partitioning
- sampling strategies
- dimensionality reduction
- graph theoretic
- sample size
- spectral graph
- weighted graph
- uniform random
- random sampling
- graph matching
- directed graph
- high dimensional
- partitioning algorithm
- distance computation
- adjacency graph
- graph representation
- sampled data
- random graphs
- sampling methods
- sampling algorithm
- machine learning
- undirected graph
- spectral clustering
- pattern mining
- bayesian networks