Linear Time Algorithms for Finding Maximal Forward References

Authors:
Zhixiang Chen;Richard H. Fowler;Ada Wai-Chee Fu
Affiliations:
-;-;-
Venue:
ITCC '03 Proceedings of the International Conference on Information Technology: Computers and Communications
Year:
2003

Citing 0
Cited 5

Full-Coverage Web Prediction based on Web Usage Mining and Site Topology

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Empirical observations on the session timeout threshold

Information Processing and Management: an International Journal
Efficient mining and prediction of user behavior patterns in mobile web systems

Information and Software Technology
Fast construction of generalized suffix trees over a very large alphabet

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Discovering forward sequences from temporal data

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, two algorithms are designed for finding maximal forward references from very large Web logs,longest sequences of Web pages visited by a user withoutrevisiting some previously visited page in the sequence, andtheir performance is comparatively analyzed. It is shownthat the two algorithms have linear (hence optimal) timecomplexity.