{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:39:36Z","timestamp":1729669176866,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ideas.2003.1214918","type":"proceedings-article","created":{"date-parts":[[2003,10,31]],"date-time":"2003-10-31T09:39:17Z","timestamp":1067593157000},"page":"117-122","source":"Crossref","is-referenced-by-count":0,"title":["Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs"],"prefix":"10.1109","author":[{"family":"Zhixiang Chen","sequence":"first","affiliation":[]},{"given":"R.H.","family":"Fowler","sequence":"additional","affiliation":[]},{"family":"Ada Wai-chee Fu","sequence":"additional","affiliation":[]},{"family":"Chunyue Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"15","DOI":"10.1016\/S0169-023X(01)00039-8"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/ADL.1998.670376"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1007\/BF01206331"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1109\/SWAT.1973.13"},{"key":"11","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":"12","first-page":"200","article-title":"What Next: 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":"3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-47887-6_28","article-title":"Optimal algorithms for fin ding user access sessions from very large Web logs, Advances in knowledge discovery and data min-ing\/PAKDD' 02","author":"chen","year":"2002","journal-title":"Lecture Notes in Computer Science 2336 Pages"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1007\/3-540-45071-8_30"},{"key":"1","doi-asserted-by":"crossref","DOI":"10.1109\/ITCC.2003.1197519","article-title":"Linear time algorithms for finding maximal forward references","author":"chen","year":"2003","journal-title":"Proc of the IEEE Intl Conf on Info Tech Coding & Computing (ITCC 2003"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1145\/321941.321946"},{"key":"7","first-page":"571","article-title":"An efficient algorithm for Web usage mining","volume":"2","author":"masseglia","year":"1999","journal-title":"Networking and Info Rmation Systems Journal"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1017\/CBO9780511574931"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/KDEX.1997.629824"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/69.683753"},{"key":"9","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"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1145\/235160.235164"}],"event":{"acronym":"IDEAS-03","name":"International Database Engineering and Applications Symposium","location":"Hong Kong, China"},"container-title":["Seventh International Database Engineering and Applications Symposium, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8622\/27319\/01214918.pdf?arnumber=1214918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T21:49:19Z","timestamp":1497563359000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214918\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/ideas.2003.1214918","relation":{},"subject":[]}}