{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:34:34Z","timestamp":1730277274140,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itcc.2003.1197519","type":"proceedings-article","created":{"date-parts":[[2004,5,13]],"date-time":"2004-05-13T14:43:37Z","timestamp":1084459417000},"page":"160-164","source":"Crossref","is-referenced-by-count":4,"title":["Linear time algorithms for finding maximal forward references"],"prefix":"10.1109","author":[{"family":"Zhixiang Chen","sequence":"first","affiliation":[]},{"given":"R.H.","family":"Fowler","sequence":"additional","affiliation":[]},{"given":"A.W.-C.","family":"Fu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/235160.235164"},{"key":"ref11","first-page":"727","article-title":"Adaptive web pages: Automatically synthesizing web pages","author":"perkowitz","year":"1998","journal-title":"Proc AAAI\/IAAI-98"},{"key":"ref12","first-page":"11","article-title":"Mining longest repeating subsequences to predict World Wide Web Surfing","author":"pitkow","year":"1999","journal-title":"Proc Second Usenix Symp Internet Technologies and Systems"},{"key":"ref13","first-page":"457","article-title":"Using path profiles to predict HTTP requests","volume":"30","author":"schetcher","year":"1998","journal-title":"Proc of the Seventh International World Wide Web Conference Computer Networks"},{"key":"ref14","first-page":"200","article-title":"WhatNext: A prediction system for Web requests using N-gram sequence models","author":"su","year":"2000","journal-title":"Proc First Int'l Conf Web Information Systems Eng"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47887-6_28"},{"journal-title":"Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs submitted for publication","year":"2003","author":"chen","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/KDEX.1997.629824"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/69.683753"},{"key":"ref8","article-title":"Exploring the bounds of Web latency reduction from cashing and prefetching","author":"kroeger","year":"1997","journal-title":"Proc Usenix Symp Internet Technologies and Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360406"},{"journal-title":"Fast construction of generalized suffix trees over a very large alphabet submitted for publication","year":"2003","author":"chen","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/306101.306124"},{"key":"ref9","first-page":"571","article-title":"An efficient algorithm for Web usage mining","volume":"2","author":"masseglia","year":"1999","journal-title":"Networking and Information Systems Journal"}],"event":{"name":"ITCC 2003. International Conference on Information Technology: Coding and Computing","acronym":"ITCC-03","location":"Las Vegas, NV, USA"},"container-title":["Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8532\/26947\/01197519.pdf?arnumber=1197519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T16:43:12Z","timestamp":1489423392000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1197519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/itcc.2003.1197519","relation":{},"subject":[]}}