关键词: 极大频繁页面集, 会话, 驻留时间, 频繁页面树

Abstract: Mining maximum frequent page set is a key to web usage mining applications, since user’s traversal patterns and motivation are latent in sessions at some time segment. According to FP-tree, a Frequent Page Tree structure with Dwell Time (abbreviated as FPDT-Tree) is designed. Utilizing FPDT-Tree to store, compress the session database that is constrained by the bi-directional dwell time, and simplify the configuration of dwell time thresholds in mining. A new algorithm called Maximum Frequent Page Set Mining is presented, which traversals quickly FPDT-Tree and discovers maximum frequent page set from the sessions. In the time constraint environment, experimental results show that MFPSM can significantly improve the execution time as long as the decision-maker’s (user) gives the appropriate dwell time constraints.

Key words: Maximum frequent page set, Session, Dwell time, FPDT-Tree