The following pages link to Marco Saerens (Q448317):
Displaying 15 items.
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification (Q448318) (← links)
- A sum-over-paths extension of edit distances accounting for all sequence alignments (Q632613) (← links)
- Semi-supervised classification and betweenness computation on large, sparse, directed graphs (Q632618) (← links)
- Fuzzy adaptive control of a certain class of SISO discrete-time processes (Q1267517) (← links)
- Classification of temporal trajectories by continuous-time recurrent nets (Q1345251) (← links)
- Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) (← links)
- Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
- A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution (Q2086590) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- A bag-of-paths framework for network data analysis (Q2181053) (← links)
- Design of biased random walks on a graph with application to collaborative recommendation (Q2669314) (← links)
- Adjusting the Outputs of a Classifier to New a <i>Priori</i> Probabilities: A Simple Procedure (Q2775812) (← links)
- Covariance and correlation measures on a graph in a generalized bag-of-paths formalism (Q4958807) (← links)
- Maximum likelihood estimation for randomized shortest paths with trajectory data (Q5022498) (← links)
- Randomized Shortest-Path Problems: Two Related Models (Q5323768) (← links)
