Parcourir SCIENCES ET TECHNIQUES par date de publication 

Voici les éléments 1-5 de 5

    • Affine iterations on nonnegative vectorsPeer reviewedClosed access 

      2004, Blondel, Vincent; NINOVE, Laure; Van Dooren, Paul, HE Louvain en Hainaut
      Article scientifique
      In this paper we consider three different iterations and and analyze their fixed points and ate of convergence. The initial vector x0 is positive, and the vectors b and y and the iteration matrix A are all nonnegative.

    • The T-PageRank : a Model of Self-Validating Effects of Web SurfingPeer reviewedClosed access 

      2006, Akian, Marianne; Gaubert, Stéphane; NINOVE, Laure, HE Léonard de Vinci
      Article scientifique
      We model the behaviour of a surfer who makes a walk on the webgraph favouring webpages with high ranking.

    • Maximizing PageRank via outlinksPeer reviewedClosed access 

      2008, de Kerchove, Cristobald; NINOVE, Laure; Van Dooren, Paul, HE Léonard de Vinci
      Article scientifique
      We analyze linkage strategies for a set of webpages for which the webmaster wants to maximize the sum of Google’s PageRank scores. The webmaster can only choose the hyperlinks starting from the webpages of and has no control on the hyperlinks from other webpages. We provide an optimal linkage strategy under some reasonable assumptions.

    • Multiple equilibria of nonhomogeneous Markov chains and self-validating web rankingsPeer reviewedClosed access 

      janvier 2008, Akian, Marianne; Gaubert, Stéphane; NINOVE, Laure, HE Léonard de Vinci
      Article scientifique
      PageRank is a ranking of the web pages that measures how often a given web page is visited by a random surfer on the web graph, for a simple model of web surfing. It seems realistic that PageRank may also have an influence on the behavior of web surfers. We propose here a simple model taking into account the mutual influence between web ranking and web surfing. Our ranking, the T-PageRank, is a ...

    • Dominant vectors of nonnegative matrices : application to information extraction in large graphsClosed access 

      21 janvier 2008, NINOVE, Laure, HE Léonard de Vinci
      TFE
      Objects such as documents, people, words or utilities, that are related in some way, for instance by citations, friendship, appearance in definitions or physical connections, may be conveniently represented using graphs or networks. An increasing number of such relational databases, as for instance theWorldWideWeb, digital libraries, social networking web sites or phone calls logs, are available. ...