Vendor : Association for Computing Machinery
E-mail this page
Related Content
Remember this itemFormat: PDF
Date:
24/07/2008
Overview
This paper proposes a new method for computing page importance, referred to as BrowseRank. The conventional approach to compute page importance is to exploit the link graph of the web and to build a model based on that graph. For instance, PageRank is such an algorithm, which employs a discrete-time Markov process as the model. Unfortunately, the link graph might be incomplete and inaccurate with respect to data for determining page importance, because links can be easily added and deleted by web content creators. This paper proposes computing page importance by using a 'User browsing graph' created from user behavior data.
|
|
The Roots for a Greener World
Discover Hitachi's Environmental Vision 2025 and featured Eco-Products
The Desktop Virtualization Revolution is here!
Find our more with Citrix Simplicity is Power
Master in Organisational Leadership
Part-time masters program from Monash University. Find out more.
Lack of visibility into network issues and performance?
Find out today. Download SolarWinds FREE 30-Day Trial Software here.
IT Salary & Skills Report 2009
Join activeTechPros for free access to the report