{"id":"https://openalex.org/W2128075414","doi":"https://doi.org/10.1145/2381716.2381853","title":"An efficient info-gain algorithm for finding frequent sequential traversal patterns from web logs based on dynamic weight constraint","display_name":"An efficient info-gain algorithm for finding frequent sequential traversal patterns from web logs based on dynamic weight constraint","publication_year":2012,"publication_date":"2012-09-03","ids":{"openalex":"https://openalex.org/W2128075414","doi":"https://doi.org/10.1145/2381716.2381853","mag":"2128075414"},"language":"en","primary_location":{"id":"doi:10.1145/2381716.2381853","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2381716.2381853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the CUBE International Information Technology Conference","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/A5076735264","display_name":"Rahul Moriwal","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rahul Moriwal","raw_affiliation_strings":["Shri Vaisnav Institute of Technology and Science, Indore (M.P.) India"],"affiliations":[{"raw_affiliation_string":"Shri Vaisnav Institute of Technology and Science, Indore (M.P.) India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101934195","display_name":"Vijay Prakash","orcid":"https://orcid.org/0000-0003-2317-4612"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijay Prakash","raw_affiliation_strings":["Shri Vaisnav Institute of Technology and Science, Indore (M.P.) India"],"affiliations":[{"raw_affiliation_string":"Shri Vaisnav Institute of Technology and Science, Indore (M.P.) India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076735264"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7105,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82216739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"718","last_page":"723"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":1.0,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9899296760559082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7376065254211426},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.692256510257721},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6131229996681213},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.5342506766319275},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.5128591060638428},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5008718967437744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4552338421344757},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4107389748096466},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3829940855503082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2021421492099762},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.16889643669128418},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1084277331829071}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9899296760559082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7376065254211426},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.692256510257721},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6131229996681213},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.5342506766319275},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.5128591060638428},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5008718967437744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4552338421344757},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4107389748096466},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3829940855503082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2021421492099762},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.16889643669128418},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1084277331829071},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2381716.2381853","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2381716.2381853","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the CUBE International Information Technology Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W202330906","https://openalex.org/W1484413656","https://openalex.org/W1491984295","https://openalex.org/W1494860503","https://openalex.org/W1506285740","https://openalex.org/W1528752789","https://openalex.org/W1548986531","https://openalex.org/W1584003909","https://openalex.org/W1597161471","https://openalex.org/W1597561788","https://openalex.org/W1608194207","https://openalex.org/W1641039719","https://openalex.org/W1676985236","https://openalex.org/W1772992909","https://openalex.org/W1831084087","https://openalex.org/W1975746167","https://openalex.org/W1989993068","https://openalex.org/W1990800901","https://openalex.org/W2030969394","https://openalex.org/W2063771604","https://openalex.org/W2066636486","https://openalex.org/W2068383400","https://openalex.org/W2107271004","https://openalex.org/W2120934516","https://openalex.org/W2122182354","https://openalex.org/W2128833260","https://openalex.org/W2147694185","https://openalex.org/W2154440943","https://openalex.org/W2156644018","https://openalex.org/W2158454296","https://openalex.org/W2168196587","https://openalex.org/W2538303219","https://openalex.org/W2538492099","https://openalex.org/W4234828246","https://openalex.org/W4254829975","https://openalex.org/W6683534485","https://openalex.org/W7066051803"],"related_works":["https://openalex.org/W1821961669","https://openalex.org/W1978615272","https://openalex.org/W2007113317","https://openalex.org/W2797291190","https://openalex.org/W2786956989","https://openalex.org/W4230405657","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W1964539781","https://openalex.org/W3183956626"],"abstract_inverted_index":{"Many":[0],"frequent":[1,15,30,64,114],"sequential":[2,31,40,47,65,78,99,115],"traversal":[3,17,32,41,48,66,79,100,116],"pattern":[4,18,33,67,117],"mining":[5,34,68,118],"algorithms":[6,35,69],"have":[7,50,54],"been":[8],"developed":[9],"which":[10],"mine":[11],"the":[12,44,63,96,105],"set":[13],"of":[14,62,77,98],"subsequences":[16],"satisfying":[19],"a":[20,25,74,82,113],"minimum":[21,83,106],"support":[22,84],"constraint":[23],"in":[24,46,60],"session":[26],"database.":[27],"However,":[28],"previous":[29],"give":[36],"equal":[37],"weightage":[38],"to":[39,94],"patterns":[42,49,80,101],"while":[43],"pages":[45],"different":[51,55],"importance":[52],"and":[53,87],"weightage.":[56],"Another":[57],"main":[58],"problem":[59],"most":[61],"is":[70,85],"that":[71],"they":[72,88],"produce":[73],"large":[75],"number":[76,97],"when":[81],"lowered":[86],"do":[89],"not":[90],"provide":[91],"alternative":[92],"ways":[93],"adjust":[95],"other":[102],"than":[103],"increasing":[104],"support.":[107],"In":[108],"this":[109],"paper,":[110],"we":[111],"propose":[112],"algorithm":[119],"with":[120],"dynamic":[121],"weight":[122],"constraint.":[123]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"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"}