乐胖代购免代理版

{"id":"https://openalex.org/W2128833260","doi":"https://doi.org/10.1109/icdm.2002.1183937","title":"SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint","display_name":"SLPMiner: an algorithm for finding frequent sequential patterns using length-decreasing support constraint","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2128833260","doi":"https://doi.org/10.1109/icdm.2002.1183937","mag":"2128833260"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2002.1183937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://conservancy.umn.edu/bitstreams/32b607b2-902a-44d8-9eef-1b7525243df5/download","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004243525","display_name":"Masakazu Seno","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Seno","raw_affiliation_strings":["Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082384108","display_name":"George Karypis","orcid":"https://orcid.org/0000-0003-2753-1437"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Karypis","raw_affiliation_strings":["Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.624,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":88,"citation_normalized_percentile":{"value":0.954163,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"418","last_page":"425"},"is_retracted":false,"is_paratext":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/T11106","display_name":"Data Management and Algorithms","score":0.9982,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9971,"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/speedup","display_name":"Speedup","score":0.7696},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.53684694},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.50640595}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.78192526},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6881386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6230358},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.53684694},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.50640595},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.44662246},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.417249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21626648},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.10814613},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icdm.2002.1183937","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"https://hdl.handle.net/11299/215527","pdf_url":"https://conservancy.umn.edu/bitstreams/32b607b2-902a-44d8-9eef-1b7525243df5/download","source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":["University of Minnesota"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://hdl.handle.net/11299/215527","pdf_url":"https://conservancy.umn.edu/bitstreams/32b607b2-902a-44d8-9eef-1b7525243df5/download","source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":["University of Minnesota"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":12,"referenced_works":["https://openalex.org/W1482472192","https://openalex.org/W1484413656","https://openalex.org/W1553499181","https://openalex.org/W1584003909","https://openalex.org/W1641039719","https://openalex.org/W2064853889","https://openalex.org/W2069356553","https://openalex.org/W2080632942","https://openalex.org/W2141115288","https://openalex.org/W2156650677","https://openalex.org/W2158454296","https://openalex.org/W4252403066"],"related_works":["https://openalex.org/W98480971","https://openalex.org/W2597809628","https://openalex.org/W2164382479","https://openalex.org/W2157978810","https://openalex.org/W2150291671","https://openalex.org/W2146343568","https://openalex.org/W2058965144","https://openalex.org/W2027972911","https://openalex.org/W2013643406","https://openalex.org/W1986179207"],"abstract_inverted_index":{"Over":[0],"the":[1,38,43,86,136,147,151,154],"years,":[2],"a":[3,32,51,93,114],"variety":[4],"of":[5,25,42,95,129,131,150],"algorithms":[6,27],"for":[7],"finding":[8],"frequent":[9,87,156],"sequential":[10,15,110],"patterns":[11,47,66,88,111],"in":[12,23],"very":[13],"large":[14],"databases":[16],"have":[17,61],"been":[18],"developed.":[19],"The":[20],"key":[21],"feature":[22],"most":[24],"these":[26],"is":[28,75],"that":[29,48,83,107,112,122,141],"they":[30,60],"use":[31],"constant":[33],"support":[34,74,90,116,138],"constraint":[35],"to":[36,56,126],"control":[37],"inherently":[39],"exponential":[40],"complexity":[41],"problem.":[44],"In":[45,98],"general,":[46],"contain":[49],"only":[50],"few":[52],"items":[53],"will":[54],"tend":[55],"be":[57,69],"interesting":[58,70],"if":[59,72],"good":[62],"support,":[63],"whereas":[64],"long":[65],"can":[67],"still":[68],"even":[71],"their":[73,96],"relatively":[76],"small.":[77],"Ideally,":[78],"we":[79,101],"need":[80],"an":[81,103],"algorithm":[82,104],"finds":[84,108],"all":[85,109],"whose":[89],"decreases":[91],"as":[92,146],"function":[94],"length.":[97],"this":[99],"paper":[100],"present":[102],"called":[105],"SLPMiner":[106,123],"satisfy":[113],"length-decreasing":[115,137],"constraint.":[117],"Our":[118],"experimental":[119],"evaluation":[120],"shows":[121],"achieves":[124],"up":[125],"two":[127],"orders":[128],"magnitude":[130],"speedup":[132],"by":[133],"effectively":[134],"exploiting":[135],"constraint,":[139],"and":[140],"its":[142],"runtime":[143],"increases":[144],"gradually":[145],"average":[148],"length":[149],"sequences":[152],"(and":[153],"discovered":[155],"patterns)":[157],"increases.":[158]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2128833260","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2024-12-12T06:04:10.284537","created_date":"2016-06-24"}