Unveiling the sampling density in non-uniform geometric graphs.
Raffaele PaolinoAleksandar BojchevskiStephan GünnemannGitta KutyniokRon LeviePublished in: ICLR (2023)
Keyphrases
- graph theoretical
- graph theory
- topological information
- low density
- graph matching
- uniform random
- graph theoretic
- graph databases
- geometric structure
- random sampling
- density function
- sampling methods
- sampling strategy
- graph mining
- directed graph
- spanning tree
- graph representation
- sampling algorithm
- sampling strategies
- frequent subgraph mining
- graph partitioning
- graph structures
- computational geometry
- pattern recognition
- parameter space
- monte carlo
- sample size
- feature space