Apriori Algorithm and

Metaheuristic Algorithms (Genetic and PSO)

1
2
 PSO

xi(t) = xi(t − 1) + vi(t)

vi(t) = W × vi(t − 1) + C1 × (xpi − xi) + C2 × (xgi − xi)

3
GA

4
Main Framework of the Proposed Approach

5
 GA -Apriori

●
Population initialisation
●
Crossover
●
Mutation
●
Selection

6
 GA-Apriori algorithm
1: Input: T: Transactional database. MinSup: MinimumSupport user’s threshold.
●
2: Output :F: The set offrequent Itemsets.
●
3: F ← ∅.
●
4: CurrentPopulation ← FindFrequentOneItemset().
●
5: while CurrentPopulation ∈ ∅ do
●
6: F ← F ∪ CurrentPopulation.
●
7: NewPopulation ← ∅.
●
8: for each two individuals (parent1, parent2) ∈ CurrentPopulation do
●
9: NewPopulation ← NewPopulation ∪ Crossover(Parent1, Parent2).
●
10: end for
●
11: for each infrequent indiv ∈ NewPopulation do
●
12: while infrequent indiv do
●
13: Mutation(indiv)
●
14: end while
●
15: end for
●
16: F ← F ∪ NewPopulation.
●
17: CurrentPopulation ← Selection(NewPopulation).
●
18: end while
●
19: return F

7
 PSO-Apriori

●
Particle’s initialisation
●
Updating positions
xi(k) = xi(k − 1) vi(k)
vi(k) = xpi(k − 1) xgi(k − 1)

8
 PSO-Apriori algorithm
1: Input: T: Transactional database. MinSup: MinimumSupport user’s threshold.
●
2: Output :F: The set offrequent Itemsets.
●
3: F ← ∅.
●
4: Particles ← FindFrequentOneItemset().
●
5: F← F ∪ Particles.x.
●
6: S ←Particles.x.
●
7: while S ∈ ∅ do
●
8: S ← ∅.
●
9: for each particle pi do
●
10: pi.vi ← joining(BestGlobal, BestLocali)
●
11: pi.xi ← Combining(pi.xi, pi.vi).
●
12: if pi.xi is frequent then
●
13: S ← ∪ pi.xi.
●
14: end if
●
15: end for
●
16: F ← F ∪ S.
●
17: end while
●
18: return F

9
Experimental evaluation

10
11
12
13