Pages that link to "Item:Q5305846"

The following pages link to Learning Theory and Kernel Machines (Q5305846):

Displaying 45 items.

• Propagation kernels: efficient graph kernels from propagated information (Q298353) (← links)
• Mining the semantic web statistical learning for next generation knowledge bases (Q408710) (← links)
• Inferring a graph from path frequency (Q427879) (← links)
• Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
• A distance measure for large graphs based on prime graphs (Q531270) (← links)
• Recent advances in graph-based pattern recognition with applications in document analysis (Q632592) (← links)
• A survey of graph edit distance (Q710632) (← links)
• Binet-Cauchy kernels on dynamical systems and its application to the analysis of dynamic scenes (Q878271) (← links)
• 3D shape retrieval using kernels on extended Reeb graphs (Q898055) (← links)
• Depth-based complexity traces of graphs (Q898379) (← links)
• Reinforcement learning algorithms with function approximation: recent advances and applications (Q903601) (← links)
• Structure-based graph distance measures of high degree of precision (Q947972) (← links)
• Matrix representations, linear transformations, and kernels for disambiguation in natural language (Q1009314) (← links)
• Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835) (← links)
• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
• Fast depth-based subgraph kernels for unattributed graphs (Q1669713) (← links)
• kProbLog: an algebraic Prolog for machine learning (Q1699913) (← links)
• The journey of graph kernels through two decades (Q1706611) (← links)
• Biomolecular event trigger detection using neighborhood hash features (Q1715092) (← links)
• Least-squares two-sample test (Q1952558) (← links)
• Semi-supervised local Fisher discriminant analysis for dimensionality reduction (Q1959540) (← links)
• Graph kernels based on tree patterns for molecules (Q1959635) (← links)
• gBoost: a mathematical programming approach to graph classification and regression (Q1959643) (← links)
• Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
• Distance metric learning for graph structured data (Q2071320) (← links)
• A generalized Weisfeiler-Lehman graph kernel (Q2102326) (← links)
• Graph based analysis for gene segment organization in a scrambled genome (Q2180788) (← links)
• A unifying view of explicit and implicit feature maps of graph kernels (Q2218378) (← links)
• Network classification with applications to brain connectomics (Q2281212) (← links)
• A new protein graph model for function prediction (Q2359336) (← links)
• An application of kernel methods to gene cluster temporal meta-analysis (Q2379643) (← links)
• Graph kernels and Gaussian processes for relational reinforcement learning (Q2433177) (← links)
• The graph matching problem (Q2444585) (← links)
• Comparison of relevance learning vector quantization with other metric adaptive classification methods (Q2507321) (← links)
• Speech recognition by composition of weighted finite automata (Q2573070) (← links)
• A Mixed Weisfeiler-Lehman Graph Kernel (Q3300154) (← links)
• A combined Weisfeiler–Lehman graph kernel for structured data (Q4689131) (← links)
• Effective graph classification based on topological and label attributes (Q4969844) (← links)
• Graph Kernels: A Survey (Q5026222) (← links)
• Bosonic Random Walk Neural Networks for Graph Learning (Q5050348) (← links)
• (Q5054613) (← links)
• Classification on Large Networks: A Quantitative Bound via Motifs and Graphons (Research) (Q5118665) (← links)
• Information-Maximization Clustering Based on Squared-Loss Mutual Information (Q5378312) (← links)
• Discussion of: Brownian distance covariance (Q5966378) (← links)
• GHNN: graph harmonic neural networks for semi-supervised graph-level classification (Q6488689) (← links)