[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2011, Vol. 37 Issue (5) :564-568    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
����ǰ׺�����������ݴ��Ҫ�ṹ����
������1, �Ž���1, ��־��2, ����3*
1. ���������̴�ѧ�����ѧԺ, ������ 150001;
2. �й�ҽѧ��ѧԺҩ��ֲ���о���, ���� 100193;
3. �վ�����ҽѧ�о���, ���� 100142
Construction of fault-tolerant synopsis over data stream based on prefix-tree
You Yuyang1, Zhang Jianpei1, Yang Zhihong2, You Yong3*
1. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China;
2. Institute of Medicinal Plant Development CAMS and PUMC, Beijing 100193, China;
3. Institute of Aviation Medicine, Beijing 100036, China

ժҪ
�����
�������
Download: PDF (1KB)   HTML 1KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ Ӧ���������������������ھ��㷨Ӧ��Ҫ�����㷨��ʱ�ո�����,��Ҫʵ�����ľ޴������Դ���ݴ�ģʽ�ھ����Ҫרע���㷨��Ч��.�ݴ�ģʽ�ھ���Ϊ�˴ӱ��������ŵ���ʵ���������л�ȡ����һ���̶ȴ���ġ����ӷ���������֪ʶ.���һ���µĵ���������ѹ�����ݴ�ǰ׺���θ�Ҫ�ṹDSFT-tree(Data Stream Fault-Tolerant Frequent Pattern Tree),������׽���������������е�����Ԫ��,�����ܹ���Ч�Ƴ���������,ʵ������޶ȵؽ��ͼ�����Դ����.���û�����ָ���λ������﷨ʵ���ݴ����θ�Ҫ�ṹ�ĸ�Ч�ع�,����һ�����ڻ������ڼ���ʵ���������������µ��ݴ�Ƶ�����ھ�.ʵ�����IBM���ݷ�����������������,�ں���ʱ���������ھ�Ƶ���������ΪFP-stream�㷨��1.5��.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
�ؼ����� ������   ��Ҫ�ṹ   �ݴ�ģʽ   ǰ׺��     
Abstract�� Complexity of data mining algorithm over data stream is the most important and it should be more focused on algorithm efficiency because of the great consumption of algorithm resources. Fault-tolerant frequent pattern mining is more generalized and suitable for extracting interesting knowledge from real-world data stream polluted by noise. An algorithm, called data stream fault-tolerant frequent pattern tree(DSFT-tree ), was proposed. It could achieve a frequency-descending and highly compact prefix-tree structure with a single-pass to capture fault-tolerant frequent itemsets in recent sliding window. To completely and efficiently perform the tree restructuring operation, an efficient mechanism based on sliding window pointer and bit-vector representation were utilized to restructure the tree. The efficient reconstruction mechanism greatly reduced the consumption of calculation resources and achieved fault-tolerant frequent itemsets mining. Experimental transaction database was generated by IBM synthetic data generator. The number of frequent itemsets extracted by DSFT-tree is 1.5 fold greater than that extracted by FP-stream. Experimental results show that developed algorithm is an efficient fault-tolerant synopsis.
Keywords�� data stream   synopsis   fault-tolerant frequent pattern   prefix-tree     
Received 2010-11-02;
Fund:

������Ȼ��ѧ����������Ŀ(61073041)

About author: ������(1977-),��,��������������,��ʿ��,arthurwy@163.com.
���ñ���:   
������, �Ž���, ��־��, ����.����ǰ׺�����������ݴ��Ҫ�ṹ����[J]  �������պ����ѧѧ��, 2011,V37(5): 564-568
You Yuyang, Zhang Jianpei, Yang Zhihong, You Yong.Construction of fault-tolerant synopsis over data stream based on prefix-tree[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2011,V37(5): 564-568
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2011/V37/I5/564
Copyright 2010 by �������պ����ѧѧ��