Search Results for author: Ilkka Kivimäki

Found 5 papers, 0 papers with code

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

no code implementations21 Sep 2020 Talayeh Aledavood, Ilkka Kivimäki, Sune Lehmann, Jari Saramäki

We do not observe any clear emergent categories of people based on the weights, but individuals are rather placed on a continuous spectrum according to the timings of their activities.

A Constrained Randomized Shortest-Paths Framework for Optimal Exploration

no code implementations12 Jul 2018 Bertrand Lebichot, Guillaume Guex, Ilkka Kivimäki, Marco Saerens

The present work extends the randomized shortest-paths framework (RSP), interpolating between shortest-path and random-walk routing in a network, in three directions.

Randomized Optimal Transport on a Graph: framework and new distance measures

no code implementations7 Jun 2018 Guillaume Guex, Ilkka Kivimäki, Marco Saerens

When the temperature is low, this formalism is shown to be equivalent to a relaxation of the optimal transport problem on a network where paths carry a flow between two discrete distributions on nodes.

Clustering

A bag-of-paths framework for network data analysis

no code implementations27 Feb 2013 Kevin Françoisse, Ilkka Kivimäki, Amin Mantrach, Fabrice Rossi, Marco Saerens

This probability captures a notion of relatedness between nodes of the graph: two nodes are considered as highly related when they are connected by many, preferably low-cost, paths.

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

no code implementations7 Dec 2012 Ilkka Kivimäki, Masashi Shimbo, Marco Saerens

In particular, we see that the results obtained with the free energy distance are among the best in all the experiments.

Clustering Node Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.