Efficient data mining for path traversal patterns
Ming-Syan Chen⋆, Jong Soo Park, Philip S. Yu · IEEE Transactions on Knowledge and Data Engineering · 1998
The authors explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. The solution procedure consists of two steps. First, they derive an algorithm to convert the original sequence of log data into a set of maximal forward references. By doing so, one can filter out the effect of some backward references, which are mainly made for ease of traveling and concentrate on mining meaningful user access sequences. Second, they derive algorithms to determine the frequent traversal patterns-i.e., large reference sequences-from the maximal forward references obtained. Two algorithms are devised for determining large reference sequences; one is based on some hashing and pruning techniques, and the other is further improved with the option of determining large reference sequences in batch so as to reduce the number of database scans required. Performance of these two methods is comparatively analyzed. It is shown that the option of selective scan is very advantageous and can lead to prominent performance improvement. Sensitivity analysis on various parameters is conducted.
Cited by 540 works. doi:10.1109/69.683753
Authors
References
- Induction of Decision Trees
- Mining association rules between sets of items in large databases
- Fast Algorithms for Mining Association Rules in Large Databases
- Mining sequential patterns
- Efficient and Effective Clustering Methods for Spatial Data Mining
- Discovery, Analysis, and Presentation of Strong Rules
- An Interval Classifier for Database Mining Applications
- Efficient similarity search in sequence databases
- Knowledge Discovery in Databases: An Attribute-Oriented Approach
- Discovery of Multiple-Level Association Rules from Large Databases