function?[LRsupconf]=Apriori（Dmin_supmin_conf）

[nm]=size（D）;
L=[];
%生成頻繁項集
Ck=eye（m）;
for?k=1:m
????p1=size（Ck1）;
????Lk=[];
????for?i=1:p1
????????sup=compute_sup（Ck（i:）D）;
????????if?sup>=min_sup
????????????Lk=[Lk;?Ck（i:）];
????????end;
????end;
????p2=size（Lk1）;
????Ck=[];
????for?i=1:p2
????????for?j=i+1:p2
????????????indi=find（Lk（i:）==1）;
????????????indj=find（Lk（j:）==1）;
????????????ind?=?indi-indj;
????????????if?（all（ind（1:k-1）==0）?&&?ind（k）~=0）
????????????????Ck=[Ck;Lk（i:）|Lk（j:）];
????????????end;
????????end;
????end;
????L=[L;Lk];
end;

%生成關聯規則
p=size（L1）;
for?i=1:p
????ind=find（L（i:）==1）;
????if?length（ind）==1
????????continue;
????end;
????for?j=1:length（ind）-1
????????nchoosek（indj）;
????end
end;

%找出強關聯
R=[];

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????????1162??2015-06-02?16:05??Apriori算法\Apriori.m
?????文件?????????294??2015-05-12?08:45??Apriori算法\apriori_data.mat
?????文件??????????90??2015-06-02?00:04??Apriori算法\compute_conf.m
?????文件?????????222??2015-06-02?00:14??Apriori算法\compute_sup.m
?????目錄???????????0??2015-06-02?08:28??Apriori算法\