[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2006, Vol. 32 Issue (02) :218-223    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
һ�ֻ�����Ч�޼������Ƶ����ھ��㷨
����, ������*
�������պ����ѧ �����ѧԺ, ���� 100083
Maximal frequent itemsets mining algorithm based on effective pruning mechanisms
Chen Peng, Lü Weifeng*
School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083, China

ժҪ
�����
�������
Download: PDF (471KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ �Թ����ھ��е����Ƶ����ھ�����������о�,�����һ�ֻ�������޼����Ƶ����Ƶ����ھ��㷨.������������������ݽṹ,�����Ƶ����ھ����ת��Ϊ����������������������������ȡ�������Ƶ���ڵ�Ĺ���. ��������㷨Ч�ʵ�һ����Ҫ��ʩ���ڱ�������������Ĺ����ж������������޼�.�������������������������,���ڴ˻����������ֱ�ӳ����޼�����ӳ����޼������񼯵ȼ��޼������޼�����,�����ܺ��Է�Ƶ���ڵ㼰�������ɵ���չ�ڵ��Լ��ٱ����Ľڵ���Ŀ.����������,�����޼����ƶ��ܹ���Ч�ؼ��������ռ�,�������񼯵ȼ��޼����Ƶ�Ч�����,�㷨���������������ݼ��ij��̶ܳ����.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� �����ھ�   ��������   �����ھ�   ��     
Abstract�� The maximal frequent itemsets mining problem was studied and an algorithm based on pruning itemset lattice effectively was proposed. The itemset lattice tree data structure was adopted to translate maximal frequent itemsets mining into the process of depth-first searching the itemset lattice tree. One of the key measures to promote performance of the algorithm is to prune the itemset lattice tree while traversing it. Three properties of itemset lattice tree were given and three pruning mechanisms, direct superset pruning, indirect superset pruning and transaction sets equivalence pruning, were proposed based on them respectively to prune the infrequent nodes and their extension nodes to reduce the number of nodes while traversing the itemset lattice tree. Test results indicate that all the three pruning mechanisms can reduce the search space effectively and the transaction sets equivalence pruning has the best effect on performance of the algorithm. Test results also indicate that performance of the algorithm is related to denseness of the datasets.
Keywords�� data mining   association rule   association mining   lattice     
Received 2005-01-10;
Fund:

�����ص�����о���չ�滮������Ŀ(G1999032709);������Ȼ��ѧ����������Ŀ(90104008)

About author: �� ��(1974-),��,���ϳ�����,��ʿ��, pchen@nlsde.buaa.edu.cn.
���ñ���:   
����, ������.һ�ֻ�����Ч�޼������Ƶ����ھ��㷨[J]  �������պ����ѧѧ��, 2006,V32(02): 218-223
Chen Peng, L�� Weifeng.Maximal frequent itemsets mining algorithm based on effective pruning mechanisms[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2006,V32(02): 218-223
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2006/V32/I02/218
Copyright 2010 by �������պ����ѧѧ��