Learning an efficient constructive sampler for graphs
type: Item
instance of: scholarly article
title: Learning an efficient constructive sampler for graphs
zbMATH Open document ID: 1404.68098
author: Fabrizio Costa
published in: Artificial Intelligence
publication date: 2017-02-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 60J22
Mathematics Subject Classification ID: 62D05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6687954
zbMATH Keywords: graph construction
zbMATH Keywords: graph sampling
zbMATH Keywords: graph kernels
zbMATH Keywords: Metropolis-Hastings sampling
describes a project that uses: gSpan
MaRDI profile type: Publication
full work available at URL: j.artint.2016.01.006
OpenAlex ID: W2234112207
Wikidata QID: Q57931583
cites work: Theoretical foundations of the potential function method in pattern recognition learning
cites work: Q3286740
cites work: Q5405117
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Q3174138
cites work: Q3787506
cites work: Q3212279
cites work: Q5590809
cites work: Q4037322
cites work: Learning Theory and Kernel Machines
cites work: Local likelihood density estimation
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Bayesian Graphical Models for Discrete Data
cites work: Q3671211
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Understanding the Hastings Algorithm
cites work: On Estimation of a Probability Density Function and Mode
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Estimating the support of a high-dimensional distribution
cites work: A parametric filtering algorithm for the graph isomorphism problem
cites work: From Frequency to Meaning: Vector Space Models of Semantics
cites work: Q4935997
DBLP publication ID: journals/ai/Costa17
DOI: 10.1016/J.ARTINT.2016.01.006
description: scientific article; zbMATH DE number 6687954