{"id":"https://openalex.org/W2121885251","doi":"https://doi.org/10.1109/ideas.2003.1214918","title":"Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs","display_name":"Linear and sublinear time algorithms for mining frequent traversal path patterns from very large Web logs","publication_year":2003,"publication_date":"2003-10-31","ids":{"openalex":"https://openalex.org/W2121885251","doi":"https://doi.org/10.1109/ideas.2003.1214918","mag":"2121885251"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2003.1214918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2003.1214918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh International Database Engineering and Applications Symposium, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100689247","display_name":"Zhixiang Chen","orcid":"https://orcid.org/0000-0002-1007-3612"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhixiang Chen","raw_affiliation_strings":["Department of Computer Science, University of Texas, Pan American, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Pan American, TX, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049057728","display_name":"Richard H. Fowler","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R.H. Fowler","raw_affiliation_strings":["Department of Computer Science, University of Texas, Pan American, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Pan American, TX, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110164824","display_name":"Ada Wai-Chee Fu","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ada Wai-chee Fu","raw_affiliation_strings":["Department of Computer Science, Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039844094","display_name":"Chunyue Wang","orcid":"https://orcid.org/0000-0002-6161-0879"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chunyue Wang","raw_affiliation_strings":["Department of Computer Science, University of Texas, Pan American, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Pan American, TX, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100689247"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8277,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87717826,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":null,"first_page":"117","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12016","display_name":"Web Data Mining and Analysis","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8516570329666138},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7577089071273804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7540959119796753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7210195660591125},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5728095769882202},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5205039381980896},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49005138874053955},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4643564224243164},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.43671587109565735},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4107057452201843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3907226026058197},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.2669728994369507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.178953617811203},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08382967114448547}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8516570329666138},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7577089071273804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7540959119796753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7210195660591125},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5728095769882202},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5205039381980896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49005138874053955},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4643564224243164},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.43671587109565735},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4107057452201843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3907226026058197},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2669728994369507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.178953617811203},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08382967114448547},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ideas.2003.1214918","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2003.1214918","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seventh International Database Engineering and Applications Symposium, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1558516741","https://openalex.org/W1567248195","https://openalex.org/W1599136575","https://openalex.org/W1667916464","https://openalex.org/W1760907038","https://openalex.org/W1970265605","https://openalex.org/W1996869586","https://openalex.org/W2020416126","https://openalex.org/W2049482525","https://openalex.org/W2059513841","https://openalex.org/W2121252285","https://openalex.org/W2139880890","https://openalex.org/W2147637882","https://openalex.org/W2149636015","https://openalex.org/W2473761236","https://openalex.org/W2533248932","https://openalex.org/W2610179052","https://openalex.org/W6602389688","https://openalex.org/W6637144541","https://openalex.org/W6637867851"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W2015304629","https://openalex.org/W2070858352","https://openalex.org/W1527782099","https://openalex.org/W2027447543","https://openalex.org/W2051533549","https://openalex.org/W1543263356","https://openalex.org/W2405149725","https://openalex.org/W2146346985","https://openalex.org/W2380018559"],"abstract_inverted_index":{"This":[0],"paper":[1],"aims":[2],"for":[3,6,28,81],"designing":[4],"algorithms":[5,27,49,70,93,101],"the":[7,32,66,77,98,103,116],"problem":[8,30],"of":[9,34,37],"mining":[10],"frequent":[11],"traversal":[12],"path":[13],"patterns":[14],"from":[15],"very":[16,44],"large":[17,45],"Web":[18],"logs":[19],"with":[20,31,65],"best":[21],"possible":[22],"efficiency.":[23],"We":[24],"devise":[25],"two":[26,48,67,92,99],"this":[29],"help":[33],"fast":[35],"construction":[36,85],"\"shallow\"":[38],"generalized":[39],"suffix":[40,83],"trees":[41],"over":[42],"a":[43,68],"alphabet.":[46],"These":[47],"have":[50],"respectively":[51],"provable":[52],"linear":[53,107],"time":[54,108,118],"and":[55,58,76,102],"sublinear":[56,117],"complexity,":[57],"their":[59],"performance":[60,112],"is":[61,88],"analyzed":[62],"in":[63,71,113],"comparison":[64],"priori-like":[69],"(Chen":[72],"et":[73],"al.,":[74],"1998)":[75],"well-known":[78],"Ukkonen":[79,104],"algorithm":[80,109,119],"online":[82],"tree":[84],"(1995).":[86],"It":[87],"shown":[89],"that":[90],"these":[91],"are":[94],"substantially":[95],"efficient":[96],"than":[97],"apriori-like":[100],"algorithm.":[105],"The":[106],"has":[110,120],"optimal":[111],"theory,":[114],"while":[115],"better":[121],"empirical":[122],"performance.":[123]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}