Computer Science
Jiawei Han, J. Pei, Yiwen Yin, Runying Mao
tlooto Summary
A novel frequent-pattern tree (FP-tree) structure is proposed, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and an efficient FP-tree-based mining method, FP-growth, is developed for mining the complete set of frequent patterns by pattern fragment growth.
Abstract
Abstract is not available.
Citation format
HAN, Jiawei, et al. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. DATA MINING AND KNOWLEDGE DISCOVERY, 2004, 8: 53–87.