Showthat, when evaluating possible associations, the confidence is always larger than the support.
What will be an ideal response?
Let the association be
a ? b
Let n be the total number of transactions, na be the number that contain a, and nab
the number that contains both a and b. Then the support is nab/n and the confidence
is nab/na. Since n is larger than na, the confidence is larger than the support
You might also like to view...
In the context of an Internet connection, LLC stands for _____.
a. leased line connection b. liability limited company c. local loop complex d. local loop carrier
In the linked list implementation of the queue, it was not necessary to set the pointer in the last node of the queue to NULL because:
A. we never had to search for an element in the queue B. the address stored in the back pointer gives the address of the last node C. it is never necessary to set a pointer in the last node of a linked list to NULL D. the last node in the queue is not necessarily the last node in the linked list