Fork me
on GitHub

#About

This is algorithm in data mining for find frequent itemset.

#Usage

Input Itemset with '-' and ',' for new transection.

You can see example below this.

Data for test

I1-I2-I5,I2-I4,I2-I3,I1-I2-I4,I1-I3,I2-I3,I1-I3,I1-I2-I3-I5,I1-I2-I3

Milk-Tea-Cake,Egg-Tea-ColdDrink,Milk-Egg-Tea-ColdDrink,Egg-ColdDrink,Juice

Lelouch-Suzaku-C2-Kallen,Lelouch-Suzaku-C2-Kallen,Lelouch-Suzaku-C2-Kallen,Lelouch-Suzaku-C2-Kallen,Lelouch-Suzaku-C2-Kallen

Input Data

Click It

Frq ItemSet

Strong Association Rule

I spent time to 18 hours to create this.