Binus Blog

An Algorithm to find set of items that are frequently associated with one another. An example use of the algorithm would be to find items that are frequently bought together in a store.

From a given data set, the frequency of each item is first calculated, based on a determined minimum support, the items that are above the minimum support will be used on the next iteration.

The items that are passed on the the next iteration is then combined into all possible sets. The frequency of those sets are then calculated again. The sets that are above the minimum support is then passed on to the next iteration.

The first and second step is then repeated until there are no longer any sets that pass the minimum support.

From the last iteration that has sets that are above the minimum support, those sets are then used to calculate the confidence of the set.

arkaan.ashadi@binus.ac.id