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.



Related Items

GTED: Graph Traversal Edit DistanceOptimal prediction of quantile functional linear regression in reproducing kernel Hilbert spacesInclusion of domain-knowledge into GNNs using mode-directed inverse entailmentTracking network dynamics: a survey using graph distancesEffectiveness of Representation and Length Variation of Shortest Paths in Graph ClassificationPropagation kernels: efficient graph kernels from propagated informationBosonic Random Walk Neural Networks for Graph LearningGraph-valued regression: prediction of unlabelled networks in a non-Euclidean graph spaceUnnamed ItemNonparametric statistics of dynamic networks with distinguishable nodesLov\'asz Meets Weisfeiler and LemanBinet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenesSpectral classes of regular, random, and empirical graphsA new dissimilarity measure for comparing labeled graphsCoarse geometric kernels for networks embeddingDominant Z-Eigenpairs of Tensor Kronecker Products DecoupleThe resistance perturbation distance: a metric for the analysis of dynamic networks3D shape retrieval using kernels on extended Reeb graphsHODLR\(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 machinesBayesian classification, anomaly detection, and survival analysis using network inputs with application to the microbiomekProbLog: an algebraic Prolog for machine learningA sum-over-paths extension of edit distances accounting for all sequence alignmentsHigh-dimensional Bayesian network classification with network global-local shrinkage priorsClassification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research)The journey of graph kernels through two decadesAn experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classificationThe graph matching problemGraph ambiguityA unifying view of explicit and implicit feature maps of graph kernelskLog: a language for logical and relational learning with kernelsAn equation-free approach to coarse-graining the dynamics of networksA Mixed Weisfeiler-Lehman Graph KernelType extension trees for feature construction and learning in relational domainsHierarchies and Ranks for Persistence PairsOn Whole-Graph Embedding TechniquesK-plex cover pooling for graph neural networksReal-valued embeddings and sketches for fast distance and similarity estimationNetwork classification with applications to brain connectomicsA combined Weisfeiler–Lehman graph kernel for structured dataTwo-sample Hypothesis Testing for Inhomogeneous Random GraphsA quotient space formulation for generative statistical analysis of graphical dataDeep graph similarity learning: a surveyModel simplification for supervised classification of metabolic networksProbabilistic clustering of time-evolving distance dataEffective graph classification based on topological and label attributesA gentle introduction to deep learning for graphsThe Complexity of Homomorphism IndistinguishabilitySimilarities on graphs: kernels versus proximity measuresLearning subtree pattern importance for Weisfeiler-Lehman based graph kernelsDistance metric learning for graph structured dataThe Notion of Pre-aggregation FunctionGraph Kernels: A Survey


Uses Software