Follow
Ilkka Kivimäki
Ilkka Kivimäki
Unknown affiliation
Verified email at aalto.fi
Title
Cited by
Cited by
Year
Predicting the continuum between corridors and barriers to animal movements using Step Selection Functions and Randomized Shortest Paths
M Panzacchi, B Van Moorter, O Strand, M Saerens, I Kivimäki, ...
Journal of Animal Ecology 85 (1), 32-42, 2016
1532016
Developments in the theory of randomized shortest paths with a comparison of graph node distances
I Kivimäki, M Shimbo, M Saerens
Physica A: Statistical Mechanics and its Applications 393, 600-616, 2014
1042014
Two betweenness centrality measures based on randomized shortest paths
I Kivimäki, B Lebichot, J Saramäki, M Saerens
Scientific reports 6 (1), 19668, 2016
732016
A graph-based approach to skill extraction from text
I Kivimäki, A Panchenko, A Dessy, D Verdegem, P Francq, H Bersini, ...
Proceedings of TextGraphs-8 graph-based methods for natural language …, 2013
642013
A bag-of-paths framework for network data analysis
K Françoisse, I Kivimäki, A Mantrach, F Rossi, M Saerens
Neural Networks 90, 90-111, 2017
582017
Random walks based modularity: application to semi-supervised learning
R Devooght, A Mantrach, I Kivimäki, H Bersini, A Jaimes, M Saerens
Proceedings of the 23rd international conference on World wide web, 213-224, 2014
332014
Effect of dimensionality reduction on different distance measures in document clustering
MS Paukkeri, I Kivimäki, S Tirunagari, E Oja, T Honkela
Neural Information Processing: 18th International Conference, ICONIP 2011 …, 2011
212011
Quantifying daily rhythms with non-negative matrix factorization applied to mobile phone data
T Aledavood, I Kivimäki, S Lehmann, J Saramäki
Scientific reports 12 (1), 5544, 2022
202022
Defining and quantifying effective connectivity of landscapes for species' movements
B Van Moorter, I Kivimäki, M Panzacchi, M Saerens
Ecography 44 (6), 870-884, 2021
202021
Semisupervised classification through the bag-of-paths group betweenness
B Lebichot, I Kivimäki, K Françoisse, M Saerens
IEEE Transactions on Neural Networks and Learning Systems 25 (6), 1173-1186, 2013
172013
Randomized shortest paths with net flows and capacity constraints
S Courtain, P Leleux, I Kivimäki, G Guex, M Saerens
Information Sciences 556, 341-360, 2021
142021
Accelerating advances in landscape connectivity modelling with the ConScape library
B Van Moorter, I Kivimäki, A Noack, R Devooght, M Panzacchi, KR Hall, ...
Methods in Ecology and Evolution 14 (1), 133-145, 2023
122023
Hospital physicians working hour characteristics and sleep quality: a cross-sectional analysis of realized working hour and survey data
K Karhula, A Koskinen, J Ervasti, T Hakola, VM Isoviita, I Kivimäki, ...
BMC Health Services Research 22 (1), 943, 2022
122022
Graph-based fraud detection with the free energy distance
S Courtain, B Lebichot, I Kivimäki, M Saerens
Complex Networks and Their Applications VIII: Volume 2 Proceedings of the …, 2020
122020
Randomized optimal transport on a graph: framework and new distance measures
G Guex, I Kivimäki, M Saerens
Network Science 7 (1), 88-122, 2019
122019
A constrained randomized shortest-paths framework for optimal exploration
B Lebichot, G Guex, I Kivimäki, M Saerens
arXiv preprint arXiv:1807.04551, 2018
82018
Maximum likelihood estimation for randomized shortest paths with trajectory data
I Kivimäki, B Van Moorter, M Panzacchi, J Saramäki, M Saerens
Journal of Complex Networks 8 (4), cnaa024, 2020
72020
Using correlation dimension for analysing text data
I Kivimäki, K Lagus, IT Nieminen, JJ Väyrynen, T Honkela
International Conference on Artificial Neural Networks, 368-373, 2010
72010
Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis.
I Kivimäki
Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2018
62018
Habitat functionality: Integrating environmental and geographic space in niche modeling for conservation planning
B Van Moorter, I Kivimäki, M Panzacchi, S Saura, B Brandão Niebuhr, ...
Ecology 104 (7), e4105, 2023
42023
The system can't perform the operation now. Try again later.
Articles 1–20