{"id":"https://openalex.org/W234548396","doi":"https://doi.org/10.21236/ada439587","title":"Parallel Formulations of Tree-Projection Based Sequence Mining Algorithms","display_name":"Parallel Formulations of Tree-Projection Based Sequence Mining Algorithms","publication_year":2003,"publication_date":"2003-01-20","ids":{"openalex":"https://openalex.org/W234548396","doi":"https://doi.org/10.21236/ada439587","mag":"234548396"},"language":"en","primary_location":{"id":"doi:10.21236/ada439587","doi":"https://doi.org/10.21236/ada439587","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada439587","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Army","raw_type":"report"},"volume":null,"type":"report","is_traditional":false,"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/A5111445677","display_name":"Valerie Guralnik","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Valerie Guralnik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082384108","display_name":"George Karypis","orcid":"https://orcid.org/0000-0003-2753-1437","observed_orcids":["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":"George Karypis","raw_affiliation_strings":["University of\u00a0Minnesota"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of\u00a0Minnesota","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9994999766349792,"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":0.9994999766349792,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.00019999999494757503,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/sequential-pattern-mining","display_name":"sequential pattern mining","score":0.8619999885559082},{"id":"https://openalex.org/keywords/distributed-memory-parallel-algorithms","display_name":"distributed-memory parallel algorithms","score":0.9229999780654907},{"id":"https://openalex.org/keywords/load-balancing","display_name":"load balancing","score":0.6069999933242798},{"id":"https://openalex.org/keywords/database-overlap","display_name":"database overlap","score":0.8109999895095825},{"id":"https://openalex.org/keywords/interprocessor-communication","display_name":"interprocessor communication","score":0.9559999704360962},{"id":"https://openalex.org/keywords/task-graphs","display_name":"task graphs","score":0.7120000123977661}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.613044023513794},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5697367191314697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5678911805152893},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5316242575645447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5172199010848999},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34583932161331177},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3243768811225891},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3240634799003601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26896730065345764},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13977983593940735},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.11960762739181519},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.05404159426689148}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.21236/ada439587","doi":"https://doi.org/10.21236/ada439587","is_oa":false,"landing_page_url":"http://doi.org/10.21236/ada439587","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"US Dept of the Army","raw_type":"report"},{"id":"pmh:ADA439587","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA439587","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:conservancy.umn.edu:11299/215546","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/11299/215546","pdf_url":null,"source":{"id":"https://openalex.org/S4306402521","display_name":"University of Minnesota Digital Conservancy (University of Minnesota)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I130238516","host_organization_name":"University of Minnesota","host_organization_lineage":["https://openalex.org/I130238516"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Report"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W20722260","https://openalex.org/W1483118879","https://openalex.org/W1484413656","https://openalex.org/W1506285740","https://openalex.org/W1565834133","https://openalex.org/W1597161471","https://openalex.org/W1608194207","https://openalex.org/W1641039719","https://openalex.org/W1991577193","https://openalex.org/W2004748427","https://openalex.org/W2005774723","https://openalex.org/W2017394090","https://openalex.org/W2025122101","https://openalex.org/W2030969394","https://openalex.org/W2064853889","https://openalex.org/W2093456341","https://openalex.org/W2099404336","https://openalex.org/W2102589938","https://openalex.org/W2127391575","https://openalex.org/W2128833260","https://openalex.org/W2137548844","https://openalex.org/W2143631149","https://openalex.org/W2146411541","https://openalex.org/W2147694185","https://openalex.org/W2156650677","https://openalex.org/W2166915329","https://openalex.org/W2210278139","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W7100218740","https://openalex.org/W4239106452","https://openalex.org/W2166951489","https://openalex.org/W1553499181","https://openalex.org/W7096070258","https://openalex.org/W2358823852","https://openalex.org/W1597163123","https://openalex.org/W2098809650","https://openalex.org/W3148951520","https://openalex.org/W2543803768"],"abstract_inverted_index":{"Discovery":[0],"of":[1,17,24,36,54,82,122,164,171],"sequential":[2,177],"patterns":[3,26,178],"is":[4],"becoming":[5],"increasingly":[6],"useful":[7],"and":[8,13,20,29,66,79,89,118,147],"essential":[9],"in":[10,179],"many":[11],"scientific":[12],"commercialdomains.":[14],"Enormous":[15],"sizes":[16],"available":[18],"datasets":[19],"possibly":[21],"large":[22,180],"number":[23,35],"mined":[25],"demand":[27],"efficient,scalable,":[28],"parallel":[30,68,110,124],"algorithms.":[31],"Even":[32],"though":[33],"a":[34,120,127],"algorithms":[37,46,60,88,106,125,161],"have":[38,70],"been":[39,71],"developed":[40],"to":[41,102,136,175],"efficiently":[42,103],"parallelizefrequent":[43],"pattern":[44],"discovery":[45,131],"that":[47,92,133,159],"are":[48,134,162],"based":[49],"on":[50,96,107,153],"thecandidate-generation-and-counting":[51],"framework,":[52],"theproblem":[53],"parallelizing":[55],"the":[56,83,90,138,172],"more":[57],"efficient":[58],"projection-based":[59],"has":[61],"received":[62],"relatively":[63],"little":[64],"attention":[65],"existing":[67],"formulations":[69],"targeted":[72],"only":[73],"toward":[74],"shared-memory":[75],"architectures.":[76,112],"The":[77],"irregular":[78],"unstructured":[80],"nature":[81],"task-graph":[84],"generated":[85],"by":[86],"these":[87,93,105,160],"fact":[91],"tasks":[94],"operate":[95],"overlapping":[97],"sub-databases":[98],"makes":[99],"it":[100],"challenging":[101],"parallelize":[104],"scalable":[108],"distributed-memory":[109,123],"computing":[111],"In":[113],"this":[114],"paper":[115],"we":[116],"present":[117],"study":[119],"variety":[121],"for":[126],"tree-projection-based":[128],"frequent":[129],"sequence":[130],"algorithm":[132],"able":[135],"minimize":[137],"various":[139],"overheads":[140],"associated":[141],"with":[142],"load":[143],"imbalance,":[144],"database":[145],"overlap,":[146],"interprocessor":[148],"communication.":[149],"Our":[150],"experimental":[151],"evaluation":[152],"a32":[154],"processor":[155],"IBM":[156],"SP":[157],"show":[158],"capable":[163],"achieving":[165],"good":[166],"speedups,":[167],"substantially":[168],"reducing":[169],"theamount":[170],"required":[173],"work":[174],"find":[176],"databases.":[181]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}