Biomedical Engineering Reference
In-Depth Information
Find the maximal 4-itemset its count is 1. In our case, which is less than the
given minimum support; therefore, this transaction is not considered as maximal
frequent; therefore, now we scan 3-itemsets and 4-itemsets in array for maximal
3-itemsets jointly. This will result in two maximal 3-itemsets
{SARIDON, DISPRIN, NIMUSULIDE} {SARIDON, DISPRIN, ADVIL}
According to apriori property, subset of maximal frequent itemsets is also
considered as all frequent subsets. They are
{SARIDON, DISPRIN, NIMUSULIDE} {SARIDON, DISPRIN, ADVIL}
{DISPRIN, NIMUSULIDE} {DISPRIN, ADVIL} {SARIDON, DISPRIN}
{SARIDON, NIMUSULIDE} {SARIDON, ADVIL} {SARIDON} {DISPRIN}
{NIMUSULIDE} {ADVIL}.
Find the frequent 1-itemset from database—it is found that {PANADOL} is
frequent but is not included in maximal itemsets
There are itemsets remaining which are not included in maximal frequent
itemset, but they are frequent. Therefore, find all frequent 1-itemsets and reduce
the database; consider only those transactions which contain frequent 1-itemset
element but are not included in the maximal frequent transaction.
Reduce
the
database
by
considering
only
the
transaction
which
contains
{PANADOL} itemset
TID
List of medicines
T002
DISPRIN, PANADOL
T004
SARIDON, DISPRIN, PANADOL
Go to next step because we have a reduced database
By calling SortRecursiveMine (ReducedDatabase)
After scanning, prune puts items in 2-D array with the count of repetition
2 Medicine set
Count
3 Medicine set
Count
{DISPRIN, PANADOL}
1
{SARIDON, DISPRIN, PANADOL}
1
Find the maximal 3-itemset its count is 1. In our case, which is less than the
given support; therefore, this transaction is not considered as maximal frequent.
Therefore, now we scan 2-itemsets and 3-itemsets in array for maximal 2-itemsets
jointly. This will result in one maximal 2-itemsets
{DISPRIN, PANADOL}
Search WWH ::




Custom Search