Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
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.1007/s10994-017-5688-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2768237932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-wise independent permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Theory and Kernel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient frequent connected subgraph mining in graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequent Hypergraph Mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subtree Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2880988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228482 / rank
 
Normal rank

Latest revision as of 14:20, 17 July 2024

scientific article
Language Label Description Also known as
English
Probabilistic frequent subtrees for efficient graph classification and retrieval
scientific article

    Statements

    Probabilistic frequent subtrees for efficient graph classification and retrieval (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2018
    0 references
    pattern mining
    0 references
    frequent subgraph mining
    0 references
    frequent subtree mining
    0 references
    probabilistic subtrees
    0 references
    efficient embedding computation
    0 references
    MIN-hashing
    0 references

    Identifiers