| 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 | 73 | 2016 |
| 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 | 65 | 2014 |
| 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 | 44 | 2017 |
| Two betweenness centrality measures based on randomized shortest paths I Kivimäki, B Lebichot, J Saramäki, M Saerens Scientific reports 6 (1), 1-15, 2016 | 35 | 2016 |
| 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 | 29 | 2013 |
| 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 | 26 | 2014 |
| 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 | 16 | 2013 |
| Effect of dimensionality reduction on different distance measures in document clustering MS Paukkeri, I Kivimäki, S Tirunagari, E Oja, T Honkela International Conference on Neural Information Processing, 167-176, 2011 | 16 | 2011 |
| 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 | 6 | 2010 |
| Randomized optimal transport on a graph: framework and new distance measures G Guex, I Kivimäki, M Saerens arXiv preprint arXiv:1806.03232, 2018 | 5 | 2018 |
| A constrained randomized shortest-paths framework for optimal exploration B Lebichot, G Guex, I Kivimäki, M Saerens arXiv preprint arXiv:1807.04551, 2018 | 4 | 2018 |
| Graph-based fraud detection with the free energy distance S Courtain, B Lebichot, I Kivimäki, M Saerens International Conference on Complex Networks and Their Applications, 40-52, 2019 | 2 | 2019 |
| 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 | 2 | 2018 |
| Natural language processing K Lagus, M Kurimo, T Honkela, S Virpioja, O Kohonen, MS Paukkeri, ... Adaptive Informatics Research Centre Department of Information and Computer …, 2012 | 2 | 2012 |
| A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data T Aledavood, I Kivimäki, S Lehmann, J Saramäki arXiv preprint arXiv:2009.09914, 2020 | 1 | 2020 |
| Randomized Shortest Paths with Net Flows and Capacity Constraints S Courtain, P Leleux, I Kivimäki, G Guex, M Saerens Information Sciences, 2020 | | 2020 |
| 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 | | 2020 |
| A Graph-Based Approach to Skill Extraction from Text∗ A Panchenko, I Kivimäki, A Dessy, D Verdegem, P Francq, C Fairon, ... TextGraphs-8 Graph-based Methods for Natural Language Processing, 2013 | | 2013 |
| Computational Cognitive Systems T Honkela, K Lagus, M Dobrinkat, O Kohonen, M Kumlander, ... Adaptive Informatics Research Centre Department of Information and Computer …, 0 | | |
| The Randomized Shortest Path model in a nutshell M Panzacchi, B Van Moorter, O Strand, M Saerens, I Kivimäki, ... | | |
