scientific article
From MaRDI portal
Publication:2896075
zbMath1242.05112MaRDI QIDQ2896075
S. V. N. Vishwanathan, Risi Kondor, Karsten M. Borgwardt, Nicol N. Schraudolph
Publication date: 13 July 2012
Full work available at URL: http://www.jmlr.org/papers/v11/vishwanathan10a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random walksspectral decompositionbioinformaticssemiringstransducersSylvester equationsrational kernelslinear algebra in RKHS
Sums of independent random variables; random walks (60G50) Theory of matrix inversion and generalized inverses (15A09) Directed graphs (digraphs), tournaments (05C20)
Related Items
GTED: Graph Traversal Edit Distance ⋮ Optimal prediction of quantile functional linear regression in reproducing kernel Hilbert spaces ⋮ Inclusion of domain-knowledge into GNNs using mode-directed inverse entailment ⋮ Tracking network dynamics: a survey using graph distances ⋮ Effectiveness of Representation and Length Variation of Shortest Paths in Graph Classification ⋮ Propagation kernels: efficient graph kernels from propagated information ⋮ Bosonic Random Walk Neural Networks for Graph Learning ⋮ Graph-valued regression: prediction of unlabelled networks in a non-Euclidean graph space ⋮ Unnamed Item ⋮ Nonparametric statistics of dynamic networks with distinguishable nodes ⋮ Lov\'asz Meets Weisfeiler and Leman ⋮ Binet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes ⋮ Spectral classes of regular, random, and empirical graphs ⋮ A new dissimilarity measure for comparing labeled graphs ⋮ Coarse geometric kernels for networks embedding ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ The resistance perturbation distance: a metric for the analysis of dynamic networks ⋮ 3D shape retrieval using kernels on extended Reeb graphs ⋮ HODLR\(d\)D: a new black-box fast algorithm for \(N\)-body problems in \(d\)-dimensions with guaranteed error bounds. Applications to integral equations and support vector machines ⋮ Bayesian classification, anomaly detection, and survival analysis using network inputs with application to the microbiome ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ A sum-over-paths extension of edit distances accounting for all sequence alignments ⋮ High-dimensional Bayesian network classification with network global-local shrinkage priors ⋮ Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) ⋮ The journey of graph kernels through two decades ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ The graph matching problem ⋮ Graph ambiguity ⋮ A unifying view of explicit and implicit feature maps of graph kernels ⋮ kLog: a language for logical and relational learning with kernels ⋮ An equation-free approach to coarse-graining the dynamics of networks ⋮ A Mixed Weisfeiler-Lehman Graph Kernel ⋮ Type extension trees for feature construction and learning in relational domains ⋮ Hierarchies and Ranks for Persistence Pairs ⋮ On Whole-Graph Embedding Techniques ⋮ K-plex cover pooling for graph neural networks ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ Network classification with applications to brain connectomics ⋮ A combined Weisfeiler–Lehman graph kernel for structured data ⋮ Two-sample Hypothesis Testing for Inhomogeneous Random Graphs ⋮ A quotient space formulation for generative statistical analysis of graphical data ⋮ Deep graph similarity learning: a survey ⋮ Model simplification for supervised classification of metabolic networks ⋮ Probabilistic clustering of time-evolving distance data ⋮ Effective graph classification based on topological and label attributes ⋮ A gentle introduction to deep learning for graphs ⋮ The Complexity of Homomorphism Indistinguishability ⋮ Similarities on graphs: kernels versus proximity measures ⋮ Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels ⋮ Distance metric learning for graph structured data ⋮ The Notion of Pre-aggregation Function ⋮ Graph Kernels: A Survey
Uses Software