Picture for Ilkka Kivimäki

Ilkka Kivimäki

A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data

Add code
Sep 21, 2020
Figure 1 for A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data
Figure 2 for A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data
Figure 3 for A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data
Figure 4 for A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data
Viaarxiv icon

A Constrained Randomized Shortest-Paths Framework for Optimal Exploration

Add code
Jul 12, 2018
Figure 1 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 2 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 3 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Figure 4 for A Constrained Randomized Shortest-Paths Framework for Optimal Exploration
Viaarxiv icon

Randomized Optimal Transport on a Graph: Framework and New Distance Measures

Add code
Jun 07, 2018
Figure 1 for Randomized Optimal Transport on a Graph: Framework and New Distance Measures
Figure 2 for Randomized Optimal Transport on a Graph: Framework and New Distance Measures
Viaarxiv icon

A bag-of-paths framework for network data analysis

Add code
Dec 14, 2016
Figure 1 for A bag-of-paths framework for network data analysis
Figure 2 for A bag-of-paths framework for network data analysis
Figure 3 for A bag-of-paths framework for network data analysis
Figure 4 for A bag-of-paths framework for network data analysis
Viaarxiv icon

Developments in the theory of randomized shortest paths with a comparison of graph node distances

Add code
Oct 03, 2013
Figure 1 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 2 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 3 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Figure 4 for Developments in the theory of randomized shortest paths with a comparison of graph node distances
Viaarxiv icon

Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness

Add code
Oct 16, 2012
Figure 1 for Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
Figure 2 for Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
Figure 3 for Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
Figure 4 for Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness
Viaarxiv icon