Suppose there are 100 items, numbered 1 to 100, and also 100 baskets, also numbered 1 to 100. Item i is in basket

b if and only if i divides b with no remainder. Thus, item 1 is in all the baskets, item 2 is in all fifty of the even

numbered baskets, and so on. Basket 12 consists of items {1, 2, 3, 4, 6, 12}, since these are all the integers that

divide 12. Answer the following questions:

(a) If the support threshold is 5, which items are frequent?

For the data, what is the confidence of the

following association rules?

(a) {24, 60} ? 8.

Q4 Compute the PageRank of each page in Figure given below, assuming no taxation. Q4 Suppose we recursively eliminate dead ends from the graph, solve the remaining graph, and estimate the PageRank for the dead-end pages. Suppose the graph is a chain of dead ends, headed by a node with a self-loop, as suggested in given figure below. What would be the Page-Rank assigned to each of the nodes? ... - O Q5: Represent the transition matrices of the following graphs