计算机科学
計算機科學
계산궤과학
COMPUTER SCIENCE
2002年
11期
76-78
,共3页
何光辉%王蔚韬%郭平%蒋渝
何光輝%王蔚韜%郭平%蔣渝
하광휘%왕위도%곽평%장투
FP-growth%Sequential pattern%Passing threshold%Output threshold
The classic sequential frequent pattern mining algorithms are based on a uniform mining support, either miss interesting patterns of low support or suffer from the bottleneck of pattern generation. In this thesis, we extend FP-growth to attack the problem of multi-level multi-dimensional sequential frequent pattern mining. The experimental result shows that our E-FP is more flexible at capturing desired knowledge than previous studies.
