Patent
1995-09-08
1997-09-16
Black, Thomas G.
395601, 395602, 395603, 395611, 395606, G06F 1730
Patent
active
056689888
ABSTRACT:
An efficient computer implemented method of mining path traversal patterns in a communications network. The method of the present invention comprises two steps. A method, called MF (standing for maximal forward references), is first used to convert an original sequence of log data into a set of traversal subsequences. Each traversal subsequence represents a maximal forward reference from the starting point of a user access. This step of converting the original log sequence into a set of maximal forward references will filter out the effect of backward references which are mainly made for ease of traveling, and enable us to concentrate on mining meaningful user access sequences. Accordingly, when backward references occur, a forward reference path terminates. This resulting forward reference path is termed a maximal forward reference. After a maximal forward reference is obtained, we back track to the starting point of the forward reference and begin a new forward reference path. In addition, the occurrence of a null source node also indicates the termination of an ongoing forward reference path and the beginning of a new one. Second, methods are developed to determine the frequent traversal patterns, termed large reference sequences, from the maximal forward references obtained above, where a large reference sequence is a reference sequence that appeared a sufficient number of times in the database to exceed a predetermined threshold.
REFERENCES:
patent: 4221003 (1980-09-01), Chang et al.
patent: 5136523 (1992-08-01), Landers
patent: 5241674 (1993-08-01), Kuorsawa et al.
patent: 5345544 (1994-09-01), Iwasaki et al.
patent: 5412769 (1995-05-01), Maruoka et al.
patent: 5486646 (1996-01-01), Yamashita et al.
patent: 5577249 (1996-11-01), Califano
Chen et al., "Data Mining for Path Traversal Patterns in a Web Environment", IEEE, Proceedings of the 16th ICDCS, 1996, pp. 385-392.
Agrawal et al., "Fast Algorithms for Mining Association Rules in Large Databases", IEEE, Proceedings of the 20th IC on VLDB, Sep. 1994, pp. 478-499.
Park et al., "An Effective Hash Based Algorithm for Mining Association Rules" Proceedings of ACM Sigmod, May, 1995, pp. 175-186.
Agrawal et al, "Efficient Similarity Search in Sequence Databases," Proceedings of the 4th IC on FDOA, Oct. 1993.
Chen Ming-Syan
Yu Philip Shi-Lung
Black Thomas G.
Homere Jean R.
International Business Machines - Corporation
Jordan Kevin M.
LandOfFree
Method for mining path traversal patterns in a web environment b does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for mining path traversal patterns in a web environment b, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for mining path traversal patterns in a web environment b will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-225788