Data mining for path traversal patterns in a web environment
Ming-Syan Chen⋆, Jong Soo Park, Philip S. Yu · IEEE International Conference on Distributed Computing Systems (ICDCS) · 2002
In this paper, we explore a new data mining capability which involved mining path traversal patterns in a distributed information providing environment like world-wide-web. First, we convert the original sequence of log data into a set of maximal forward references and filter out the effect of some backward references which are mainly made for ease of traveling. Second, we 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.
Cited by 327 works. doi:10.1109/icdcs.1996.507986
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
- Discovery, Analysis, and Presentation of Strong Rules
- An Interval Classifier for Database Mining Applications
- Efficient similarity search in sequence databases
- An effective hash-based algorithm for mining association rules
- Knowledge Discovery in Databases: An Attribute-Oriented Approach
- Discovery of Multiple-Level Association Rules from Large Databases