السلام عليكم ورحمة الله وبركاته ..كل العام وانت بخير
اخواني الكرام لدي سؤال حول كيفية عمل برمجة لمثل هذا اللوغارتيم ..هل ممكن المساعدة ولو بفكرة
Algorithm Apriori_IMLMS
Input: TD: Transaction Database; ms(k)(k=0,1,…,n):
minimum support threshold;
Output: FIS: set of interesting frequent itemsets;inFIS:
set of interesting infrequent itemsets;
(1) FIS=Φ; inFIS=Φ;
(2) temp1 = {A|A∈1-itemsets,s(A)≥ms(0)};
FIS1 = {A|A∈temp1 ∧ s(A)≥ms(1)};
inFIS1 = temp1-FIS1;
(3) for (k=2;tempk1≠Φ;k++) do
begin
(3.1) Ck = apriori_gen(tempk1, ms(0));
(3.2) for each transaction t∈TD do
begin
/*scan transaction database TD*/
Ct=subset(Ck, t);
for each candidate c ∈ Ct
c.count++;
end
(3.3) tempk = {c|c∈Ck (c.count/|TD|)≥ms(0)};
FISk = {A|A∈tempk ∧ A.count/|TD|≥ms(k)};
inFISk = tempk – FISk
(3.4) /*prune all uninteresting k-itemsets in FISk */
for each itemset M in FISk do
if NOT (fipi(M)) then
FISk =FISk – { M }
(3.5)/*prune all uninteresting k-itemsets in inFISk */
for each itemset N in inFISk do
if NOT (iipi(N)) then
inFISk =inFISk – { N }
end
(4) FIS = ∪FISk; inFIS = ∪inFISk;
(5) return FIS and inFIS;
