Information Technology Reference
In-Depth Information
2. If T has a child N = p
3. N.count++
4. Else
5. Creat a new node N, N.count =1
6. Let its parent link be linked to T
7. Let its node-link be linked to the nodes with the
same item-name via the node-link structure
8. End while
Procedure Pruning(T, i j )
1. For each node n in the node-link i j in T do
2. If n is a leaf
3. Remove n
4. Else
5. Remove n && its parent link will be linked to its
child
6. End for
Procdeure Merge(T)
1. For each i j in MIN frequent item header table do
2. If there are childnodes with the same item name
3. Merge these childnodes
4. Set the count as the summation of these nodes' count
5. End for
Table 2. All conditional pattern bases and conditional frequent patterns
Item
MIS
Cond. Pattern bases
Cond. Frequent patterns
122
1.279
<112, 22*, 223: 2>, <112, 21*, 211:
1>
{222, 122:2}, {22*, 122:2}, {112,
122:2}, {22*, 222, 122:2}, {112,
222, 122:2}, {112, 22*, 122:2},
{112, 22*, 222, 122:2}
123
1.279
<21*, 111, 211:1>, <21*, 111, 212:1>,
<111, 22*:1>, <112, 22*, 222: 1>,
<112, 21*, 211:1>, <112, 21*, 212:1>
{112, 123:3}, {21*, 123:4}, {111,
123:3}, {22*, 123:2}, {211, 123:2},
{212, 123:2}, {112, 21*, 123:2},
{21*, 111, 123:2}, {21*, 211,
123:2}, {21*, 212, 123:2}
212
1.382
<21*, 111>, <112, 21*>
{21*, 212:2}
222
1.382
<112, 22*>
{112, 222:3}, {22*, 222:3}, {112,
22*, 222:3}
211
1.382
<21*, 111>, <112, 21*>
{21*,211:4}, {111, 211:2}, {112,
211:4}, {21*, 111, 211:2}, {112,
21*, 211:2}
22*
4
<111>, <112>
ʦ
111
4
<21*>
ʦ
21*
4
<112>
ʦ
112
4
ʦ
ʦ
Search WWH ::




Custom Search