ժҪ ���������ھ�Ĺؼ�����Ƶ����Ŀ�������,Ϊ���ܹ��ں�����ֵ�������ݵĽ������ݿ��п�����⺬�ж�ֵ��Ƶ����Ŀ��,��չ�˺��ж�����ֵ�Ľ������ݿⶨ��.�ڴ˻�����,��������˼��,�������н�����ͽ�����������,�����Apriori�㷨����������,����ڸ�����С����֦·�������Ƶ����Ŀ����ⷽ��FABCTA(Fast Algorithm ByCandidate Transaction Tree and Apriori).ͨ��������ʵ����ʵ��Ա�,FABCTAЧ����������Apriori�㷨.
It is very important to get the frequent item set in the associate rule mining. In order to fast obtain the frequent item set from a database that includes multiple values, the definition of transaction database was extended. And then by the tree concept, a special tree was built in which every node is formed by item and item’s count. At last, on the foundation of Apriori Algorithm and Artificial Intelligent Search, FABCTA(fast algorithm by candidate transaction tree and apriori) was presented to solve the frequent item set in small branches of tree. By the test on real data, FABCTA is more efficient than Apriori algorithm.