Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Hong, Dohy"'
In this paper we present a new method that can accelerate the computation of the PageRank importance vector. Our method, called D-Iteration (DI), is based on the decomposition of the matrix-vector product that can be seen as a fluid diffusion model a
Externí odkaz:
http://arxiv.org/abs/1501.06350
Autor:
Hong, Dohy
In this paper, we propose a new ranking method inspired from previous results on the diffusion approach to solve linear equation. We describe new mathematical equations corresponding to this method and show through experimental results the potential
Externí odkaz:
http://arxiv.org/abs/1309.1645
Autor:
Hong, Dohy
In this paper, we explain the convergence speed of different iteration schemes with the fluid diffusion view when solving a linear fixed point problem. This interpretation allows one to better understand why power iteration or Jacobi iteration may co
Externí odkaz:
http://arxiv.org/abs/1304.1760
Autor:
Hong, Dohy
In this paper, we introduce a new iterative method which we call one step back approach: the main idea is to anticipate the consequence of the iterative computation per coordinate and to optimize on the choice of the sequence of the coordinates on wh
Externí odkaz:
http://arxiv.org/abs/1302.4317
In this paper, we define the general framework to describe the diffusion operators associated to a positive matrix. We define the equations associated to diffusion operators and present some general properties of their state vectors. We show how this
Externí odkaz:
http://arxiv.org/abs/1301.3007
Autor:
Hong, Dohy, Burnside, Gérard
In this paper, we describe the general framework to describe the diffusion operators associated to a positive matrix. We define the equations associated to diffusion operators and present some general properties of their state vectors. We show how th
Externí odkaz:
http://arxiv.org/abs/1206.3932
Autor:
Hong, Dohy, Jacquet, Philippe
In this paper, we apply the ideas of the matrix column based diffusion approach to define a new eigenvector computation algorithm of a stationary probability of a Markov chain.
Comment: 4 pages
Comment: 4 pages
Externí odkaz:
http://arxiv.org/abs/1206.3177
This paper describes the first results obtained by implementing a novel approach to rank vertices in a heterogeneous graph, based on the PageRank family of algorithms and applied here to the bipartite graph of papers and authors as a first evaluation
Externí odkaz:
http://arxiv.org/abs/1205.6373
In this paper, we revisit the D-iteration algorithm in order to better explain different performance results that were observed for the numerical computation of the eigenvector associated to the PageRank score. We revisit here the practical computati
Externí odkaz:
http://arxiv.org/abs/1204.6255
Autor:
Hong, Dohy
In this paper, we propose a new adaptation of the D-iteration algorithm to numerically solve the differential equations. This problem can be reinterpreted in 2D or 3D (or higher dimensions) as a limit of a diffusion process where the boundary or init
Externí odkaz:
http://arxiv.org/abs/1204.6249