Data mining for path traversal patterns in a web environment

  • Authors:
  • Affiliations:
  • Venue:
  • ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
  • Year:
  • 1996

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.