The weight function in the subtree kernel is decisive

MaRDI QIDQ4969116zbMATH OpenFDO

Authors Romain Azaïs, Florian Ingels

Publication date 5 October 2020

Full work available at URL https://arxiv.org/abs/1904.05421, https://jmlr.csail.mit.edu/papers/v21/19-290.html

zbMATH Keywords

classification of tree datakernel methodssubtree kerneltree compressionweight function

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05) Computational aspects of data analysis and big data (68T09)

Recommendations

• Linear-time algorithms for the subpath kernel
• Approximate tree kernels
• A theory of subtree matching and tree kernels based on the edit distance concept
• On simply structured bases of tree kernels
• Graph kernels based on tree patterns for molecules

Cites work

• A survey on tree edit distance and related problems
• A theory of learning with similarity functions
• Inference for conditioned Galton-Watson trees from their Harris path
• Variations on the Common Subexpression Problem

Cited in

(4)

• Isomorphic unordered labeled trees up to substitution ciphering
• Enumeration of irredundant forests
• Approximate tree kernels
• Linear-time algorithms for the subpath kernel

Describes a project that uses

Uses Software

• Stony Brook
• treex

This page was built for publication: The weight function in the subtree kernel is decisive

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969116)