Efficient algorithm to compute Markov transitional probabilities for a desired PageRank
Sign Up to like & getrecommendations! Published in 2020 at "EPJ Data Science"
DOI: 10.1140/epjds/s13688-020-00240-z
Abstract: We propose an efficient algorithm to learn the transition probabilities of a Markov chain in a way that its weighted PageRank scores meet some predefined target values. Our algorithm does not require any additional information… read more here.
Keywords: markov transitional; desired pagerank; efficient algorithm; algorithm compute ... See more keywords