초록 ▼

A method for estimating an association between the media objects and the seed Web page accessed by a user. The method is employed in the context of a Web space on a network having Web pages and links between those Web pages modeled as a directed graph. Each Web page comprises a set of media objects

A method for estimating an association between the media objects and the seed Web page accessed by a user. The method is employed in the context of a Web space on a network having Web pages and links between those Web pages modeled as a directed graph. Each Web page comprises a set of media objects and a page author. For each object a size, a user preference and a page author preference are determined. The network has an available pre-fetch bandwidth. The method calculates a weight for each Web object by applying preference rules defined by and user preference and page author preference to the contents of the set of media objects. Next, a random walk graph is generated, and object gains are calculated by finding a steady state distribution of the random walk graph. The object gain represents an association between the object and the seed Web page.

대표청구항 ▼

1. On a computer network having a set of Web pages V and a set of links E between those Web pages represented as an undirected neighborhood graph GN(VN,EN), the computer network further including seed Web pages vaand vbin V, a method executable on the computer network for estimating associations bet

1. On a computer network having a set of Web pages V and a set of links E between those Web pages represented as an undirected neighborhood graph GN(VN,EN), the computer network further including seed Web pages vaand vbin V, a method executable on the computer network for estimating associations between vaand vband other Web pages viεV,the method comprising the steps of: constructing a directed random walk graph by creating a new vi' in V for each viεVN,and creating two directed edges e'2×k=i',vj') and e'2×k-1=j',vi'> in E for each ek=i,vj>εENwherein both viand Vjare in VN, computing a penalty value penalty(vi') for all vertices vi'εV, and constructing a |V|×|V| transition matrix T, where T[j,i] represents a transition value for each directed edge in E denoting a likelihood of moving to vertex vifrom vertex vj; and