Near-Entropy Hotlink Assignments

Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T . Each web page i carries a probability pi representative of the frequency with which it is visited. By adding hotlinks -- shortcuts from a node to one of its descendents -- we wish to minimize the expected number of steps l needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink per node, our method guarantees an up

• Type: Conference
• Year: 2006
• Where: ESA
• Authors: Karim Douïeb, Stefan Langerman
• Keywords: Algorithms, Arbitrary Maximum Degree, ESA 2006, Home Page, Web Page