Effectiveness of representation and length variation of shortest paths in graph classification

DOI10.1007/978-3-319-69900-4_65MaRDI QIDQ5045374zbMATH OpenOpenAlexFDO

Authors Asif Salim, S. S. Shiju, Sumitra

Publication date 4 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69900-4_65

zbMATH Keywords

graph kernelskernel methodsshortest pathssupport vector machines

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Graph kernels
• Weisfeiler-Lehman graph kernels
• On graph kernels: hardness results and efficient alternatives.
• Graph kernels
• scientific article; zbMATH DE number 5003286

Cites work

• An introduction to support vector machines and other kernel-based learning methods.
• Graph kernels
• Weisfeiler-Lehman graph kernels

Cited in

(1)

• Generalized shortest path trees: a novel graph class by example of semiotic networks

Describes a project that uses

Uses Software

• LIBSVM
• AFGen

This page was built for publication: Effectiveness of representation and length variation of shortest paths in graph classification

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