Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
From MaRDI portal
Publication:2163223
DOI10.1007/s10994-022-06130-xOpenAlexW4220949627MaRDI QIDQ2163223
Enrique Alfonso Sánchez-Pérez, H. Falciani
Publication date: 10 August 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-022-06130-x
Related Items (2)
Extension of semi-Lipschitz maps on non-subadditive quasi-metric spaces: new tools for Artificial Intelligence ⋮ Extension procedures for lattice Lipschitz operators on Euclidean spaces
Cites Work
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- A survey of graph edit distance
- Causal graphs and structurally restricted planning
- Lipschitz functions
- Learning similarity with cosine similarity ensemble
- Discrete dynamical systems on graphs and Boolean functions
- Semi-Lipschitz functions and best approximation in quasi-metric spaces
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- Network analysis. Methodological foundations.
- Graph kernels and Gaussian processes for relational reinforcement learning
- Efficient Classification for Metric Data
- Distance in Graphs
- Algebraic Distance on Graphs
- On a routing problem
- Distance in graphs
- On the distance matrix of a directed graph
- A graph distance metric based on the maximal common subgraph
- An Introduction to Machine Learning
- From Word To Sense Embeddings: A Survey on Vector Representations of Meaning
- Distance matrix of a graph and its realizability
- Encyclopedia of Distances
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
