DocumentCode
1889073
Title
Notice of Retraction
Research of Algorithm of Mining Frequent Closed Pattern about Distributed Data Stream
Author
Gao Hong-bin ; Xie Jing-jing
Author_Institution
Coll. of Comput., Wuyi Univ., Jiangmen, China
fYear
2010
fDate
25-26 Dec. 2010
Firstpage
1
Lastpage
5
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
New algorithm of mining frequent closed pattern about distributed data stream was proposed. The algorithm bases on the three-layer structure model. First, the leaf-layer nodes overlap the collecting item-sets. Second, the middle A-layer nodes expurgate the infrequent items of overlapped items again and again, and then insert them into prefix-sub-tree. Third, the top-layer nodes and the middle-layer ones answer the clients´ request online in feedback way. Analysis and experimental results indicate: This algorithm really resolves the heavy workload between layers and has favorable application prospect.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
New algorithm of mining frequent closed pattern about distributed data stream was proposed. The algorithm bases on the three-layer structure model. First, the leaf-layer nodes overlap the collecting item-sets. Second, the middle A-layer nodes expurgate the infrequent items of overlapped items again and again, and then insert them into prefix-sub-tree. Third, the top-layer nodes and the middle-layer ones answer the clients´ request online in feedback way. Analysis and experimental results indicate: This algorithm really resolves the heavy workload between layers and has favorable application prospect.
Keywords
data mining; data mining; distributed data stream; frequent closed pattern; leaf-layer nodes; middle A-layer nodes; prefix-subtree; three-layer structure model; Algorithm design and analysis; Computers; Data mining; Data models; Distributed databases; Finishing; Nickel;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Engineering and Computer Science (ICIECS), 2010 2nd International Conference on
Conference_Location
Wuhan
ISSN
2156-7379
Print_ISBN
978-1-4244-7939-9
Type
conf
DOI
10.1109/ICIECS.2010.5677822
Filename
5677822
Link To Document