default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlkka Kivimäki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Sylvain Courtain, Guillaume Guex
, Ilkka Kivimäki, Marco Saerens:
Relative entropy-regularized optimal transport on a graph: a new algorithm and an experimental comparison. Int. J. Mach. Learn. Cybern. 14(4): 1365-1390 (2023)- 2021
- [j5]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized shortest paths with net flows and capacity constraints. Inf. Sci. 556: 341-360 (2021) - [i8]Sylvain Courtain, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison. CoRR abs/2108.10004 (2021) - [i7]Ilkka Kivimäki, Bram Van Moorter, Manuela Panzacchi, Jari Saramäki, Marco Saerens:
Maximum likelihood estimation for randomized shortest paths with trajectory data. CoRR abs/2112.08481 (2021) - 2020
- [j4]Ilkka Kivimäki, Bram Van Moorter, Manuela Panzacchi, Jari Saramäki, Marco Saerens:
Maximum likelihood estimation for randomized shortest paths with trajectory data. J. Complex Networks 8(4) (2020) - [i6]Talayeh Aledavood, Ilkka Kivimäki, Sune Lehmann, Jari Saramäki:
A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data. CoRR abs/2009.09914 (2020)
2010 – 2019
- 2019
- [j3]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized optimal transport on a graph: framework and new distance measures. Netw. Sci. 7(1): 88-122 (2019) - [c5]Sylvain Courtain, Bertrand Lebichot, Ilkka Kivimäki, Marco Saerens:
Graph-Based Fraud Detection with the Free Energy Distance. COMPLEX NETWORKS (2) 2019: 40-52 - [i5]Sylvain Courtain, Pierre Leleux, Ilkka Kivimäki, Guillaume Guex, Marco Saerens:
Randomized Shortest Paths with Net Flows and Capacity Constraints. CoRR abs/1910.01849 (2019) - 2018
- [b1]Ilkka Kivimäki:
Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis. Catholic University of Louvain, Louvain-la-Neuve, Belgium, 2018 - [i4]Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
Randomized Optimal Transport on a Graph: Framework and New Distance Measures. CoRR abs/1806.03232 (2018) - [i3]Bertrand Lebichot, Guillaume Guex, Ilkka Kivimäki, Marco Saerens:
A Constrained Randomized Shortest-Paths Framework for Optimal Exploration. CoRR abs/1807.04551 (2018) - 2017
- [j2]Kevin Françoisse, Ilkka Kivimäki, Amin Mantrach, Fabrice Rossi, Marco Saerens:
A bag-of-paths framework for network data analysis. Neural Networks 90: 90-111 (2017) - 2015
- [i2]Ilkka Kivimäki, Bertrand Lebichot, Jari Saramäki, Marco Saerens:
Two betweenness centrality measures based on Randomized Shortest Paths. CoRR abs/1509.03147 (2015) - 2014
- [j1]Bertrand Lebichot, Ilkka Kivimäki, Kevin Françoisse, Marco Saerens:
Semisupervised Classification Through the Bag-of-Paths Group Betweenness. IEEE Trans. Neural Networks Learn. Syst. 25(6): 1173-1186 (2014) - [c4]Robin Devooght, Amin Mantrach, Ilkka Kivimäki, Hugues Bersini, Alejandro Jaimes, Marco Saerens:
Random walks based modularity: application to semi-supervised learning. WWW 2014: 213-224 - 2013
- [c3]Ilkka Kivimäki, Alexander Panchenko, Adrien Dessy, Dries Verdegem, Pascal Francq, Hugues Bersini, Marco Saerens:
A Graph-Based Approach to Skill Extraction from Text. TextGraphs@EMNLP 2013: 79-87 - 2012
- [i1]Bertrand Lebichot, Ilkka Kivimäki, Kevin Françoisse, Marco Saerens:
Semi-Supervised Classification Through the Bag-of-Paths Group Betweenness. CoRR abs/1210.4276 (2012) - 2011
- [c2]Mari-Sanna Paukkeri, Ilkka Kivimäki, Santosh Tirunagari, Erkki Oja, Timo Honkela:
Effect of Dimensionality Reduction on Different Distance Measures in Document Clustering. ICONIP (3) 2011: 167-176 - 2010
- [c1]Ilkka Kivimäki, Krista Lagus, Ilari T. Nieminen, Jaakko J. Väyrynen, Timo Honkela:
Using Correlation Dimension for Analysing Text Data. ICANN (1) 2010: 368-373
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
