Learning an efficient constructive sampler for graphs
From MaRDI portal
Publication:511780
DOI10.1016/j.artint.2016.01.006zbMath1404.68098DBLPjournals/ai/Costa17OpenAlexW2234112207WikidataQ57931583 ScholiaQ57931583MaRDI QIDQ511780
Publication date: 22 February 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.01.006
Computational methods in Markov chains (60J22) Sampling theory, sample surveys (62D05) Learning and adaptive systems in artificial intelligence (68T05) Grammars and rewriting systems (68Q42)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parametric filtering algorithm for the graph isomorphism problem
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Local likelihood density estimation
- Theoretical foundations of the potential function method in pattern recognition learning
- Estimating the Support of a High-Dimensional Distribution
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Bayesian Graphical Models for Discrete Data
- Handbook of Graph Grammars and Computing by Graph Transformation
- From Frequency to Meaning: Vector Space Models of Semantics
- Equation of State Calculations by Fast Computing Machines
- Understanding the Hastings Algorithm
- Learning Theory and Kernel Machines
- On Estimation of a Probability Density Function and Mode
This page was built for publication: Learning an efficient constructive sampler for graphs