DocumentCode
2889428
Title
Safp: A New Self-Adaptive Algorithm for Frequent Pattern Mining
Author
Wang, Xin-yin ; Zhang, Jin ; Ma, Hai-bing ; Hu, Yun-Fa
Author_Institution
Dept. of C.I.T, Fudan Univ., Shanghai
fYear
2006
fDate
13-16 Aug. 2006
Firstpage
1287
Lastpage
1292
Abstract
This article builds a robust algorithm by methodically combining two different mining algorithms on FP-tree while adjusting the mining strategy dynamically and automatically during a complete process of frequent pattern mining. This article firstly proposes the naive depth first search algorithm (NDFS) that is based on FP-tree, and then briefly analyzes its performance on different datasets. After that, a new self-adaptive algorithm (SAFP) is proposed, which combines the NDFS with the FP-growth by a dynamic mining strategy on conditional FP-trees. Experiments demonstrate that the SAFP is more robust and efficient than both the NDFS and the FP-growth on various datasets
Keywords
data mining; tree data structures; tree searching; FP-tree; SAFP; frequent pattern mining; naive depth first search algorithm; robust mining algorithms; self-adaptive algorithm; Algorithm design and analysis; Association rules; Cybernetics; Data mining; Electronic mail; Frequency; Frequency conversion; Heuristic algorithms; Machine learning; Machine learning algorithms; Magnetic heads; Performance analysis; Robustness; Tagging; Transaction databases; Association rules; Data mining; FP-tree; Frequent pattern; Robustness; Self-adaptive;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics, 2006 International Conference on
Conference_Location
Dalian, China
Print_ISBN
1-4244-0061-9
Type
conf
DOI
10.1109/ICMLC.2006.258654
Filename
4028262
Link To Document