Constraint based frequent pattern mining for generalized query templates from web log

Abstract

The World-Wide Web provides every Internet citizen access to an abundance of information, but difficulty increases in identifying the relevant piece of information. Popular Search engine uses log for keeping track of user activities including user queries, click-through and their behavior. Research in web mining tries to address this problem by discovering knowledge from user logs. We propose an approach to discover patterns that can predict user’s search, without aid of remote server. Our method analyses user’s interactions by constructing FP-tree, which facilitates in producing templates from the user logs. Consensus tree growth is restricted and templates are obtained from leaves, which assist user’s searching process with precision. We show the effectiveness of our method on realistic web logs and explore the tradeoff between prediction’s accuracy and usefulness. Test results show the improved algorithm has lower complexity of time and space, and fit the capacity of memory.