{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:26:38Z","timestamp":1760487998766},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0169-023x(01)00039-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:36:15Z","timestamp":1027607775000},"page":"191-214","source":"Crossref","is-referenced-by-count":37,"title":["Efficient mining of traversal patterns"],"prefix":"10.1016","volume":"39","author":[{"given":"Yongqiao","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Margaret H.","family":"Dunham","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(01)00039-8_BIB1","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB2","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"Agrawal","year":"1994"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/ICDE.1995.380415","article-title":"Mining sequential patterns","author":"Agrawal","year":"1995"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB4","author":"Bieganski"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB5","article-title":"Navigation pattern discovery from internet data","author":"Buchner","year":"1999"},{"issue":"2","key":"10.1016\/S0169-023X(01)00039-8_BIB6","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/69.683753","article-title":"Efficient data mining for path traversal patterns","volume":"10","author":"Chen","year":"1998","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0169-023X(01)00039-8_BIB7","series-title":"Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data","first-page":"145","article-title":"Online association rule mining","author":"Hidber","year":"1999"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB8","first-page":"230","article-title":"Color set size problem with application to string matching","volume":"vol. 644","author":"Kwong Hui","year":"1992"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB9","article-title":"Making web servers pushier","author":"Lan","year":"1999"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB10","article-title":"Mining association rules: anti-skew algorithms","author":"Lin","year":"1998"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB11","first-page":"210","article-title":"Discovering frequent episodes in sequences","author":"Mannila","year":"1995"},{"issue":"1","key":"10.1016\/S0169-023X(01)00039-8_BIB12","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB13","series-title":"Java Servlets","author":"Moss","year":"1999"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB14","first-page":"592","article-title":"Mining access patterns efficiently from web logs","author":"Pei","year":"2000"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB15","first-page":"432","article-title":"An efficient algorithm for mining association rules in large databases","author":"Savasere","year":"1995"},{"issue":"8","key":"10.1016\/S0169-023X(01)00039-8_BIB16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/345124.345167","article-title":"Web usage mining for web site evaluation","volume":"43","author":"Spiliopoulou","year":"2000","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/S0169-023X(01)00039-8_BIB17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB18","first-page":"115","article-title":"Combinatorial pattern discovery for scientific data: some preliminary results","author":"Wang","year":"1994"},{"key":"10.1016\/S0169-023X(01)00039-8_BIB19","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X01000398?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X01000398?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:30:12Z","timestamp":1556425812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X01000398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0169023X01000398"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(01)00039-8","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}