Learning an efficient constructive sampler for graphs (Q511780): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/ai/Costa17, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2016.01.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2234112207 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57931583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical foundations of the potential function method in pattern recognition learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-Scale Machine Learning with Stochastic Gradient Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3212279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local likelihood density estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Graphical Models for Discrete Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding the Hastings Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Estimation of a Probability Density Function and Mode / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Grammars and Computing by Graph Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Support of a High-Dimensional Distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric filtering algorithm for the graph isomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Frequency to Meaning: Vector Space Models of Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4935997 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ai/Costa17 / rank
 
Normal rank

Latest revision as of 14:49, 13 November 2024

scientific article
Language Label Description Also known as
English
Learning an efficient constructive sampler for graphs
scientific article

    Statements

    Learning an efficient constructive sampler for graphs (English)
    0 references
    0 references
    22 February 2017
    0 references
    graph construction
    0 references
    graph sampling
    0 references
    graph kernels
    0 references
    Metropolis-Hastings sampling
    0 references

    Identifiers