Practical Applications of Data Mining

2.4 assoCiation rules in hypertext DataBases 47

graph is intended to represent the navigation patterns of a single user or

a group of users with similar interests. In the following section, we present a

formal model of a simple hypertext system in terms of a weighted directed

graph.

2.4.1 Formal Model

The formal model for a hypertext system is given as a weighted directed

graph G = (N, E ), where N is a set of nodes and E is a set of arcs, each con-

necting a pair of nodes. A node represents a page, while an arc (A, B) repre-

sents a link between a pair of pages. In the arc, A is called the source node,

and B is the target node. For simplicity, we can assume that there is at most

one link between any two nodes. The graph is weighted, ...