( en | de | ru )

 

Disambiguation of "Kivimäki, Ilkka"

Author of the publication

copydeleteadd this publication to your clipboard
Two betweenness centrality measures based on Randomized Shortest Paths.

, , , and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ilkka Hanski

Ilkka Kronholm

Ilkka Haavisto

Ilkka Saarinen

Ilkka-Peter Ahlborn

 

Other publications of authors with the same name

Graph-Based Fraud Detection with the Free Energy Distance., , , and . COMPLEX NETWORKS (2), volume 882 of Studies in Computational Intelligence, page 40-52. Springer, (2019)A Non-negative Matrix Factorization Based Method for Quantifying Rhythms of Activity and Sleep and Chronotypes Using Mobile Phone Data., , , and . CoRR, (2020)A bag-of-paths framework for network data analysis., , , , and . Neural Networks, (2017)Using Correlation Dimension for Analysing Text Data., , , , and . ICANN (1), volume 6352 of Lecture Notes in Computer Science, page 368-373. Springer, (2010)Randomized Shortest Paths with Net Flows and Capacity Constraints., , , , and . CoRR, (2019)Randomized shortest paths with net flows and capacity constraints., , , , and . Inf. Sci., (2021)Maximum likelihood estimation for randomized shortest paths with trajectory data., , , , and . J. Complex Networks, (2020)Distances, centralities and model estimation methods based on randomized shortest paths for network data analysis.. Catholic University of Louvain, Louvain-la-Neuve, Belgium, (2018)base-search.net (ftunivlouvain:oai:dial.uclouvain.be:boreal:208413).Randomized Optimal Transport on a Graph: Framework and New Distance Measures., , and . CoRR, (2018)Random walks based modularity: application to semi-supervised learning., , , , , and . WWW, page 213-224. ACM, (2014)