{"id":"https://openalex.org/W2904457597","doi":"https://doi.org/10.1109/itsc.2018.8569682","title":"An Unsupervised Random Forest Clustering Technique for Automatic Traffic Scenario Categorization","display_name":"An Unsupervised Random Forest Clustering Technique for Automatic Traffic Scenario Categorization","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2904457597","doi":"https://doi.org/10.1109/itsc.2018.8569682","mag":"2904457597"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2018.8569682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.02121","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Friedrich Kruber","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106192","display_name":"Technische Hochschule Ingolstadt","ror":"https://ror.org/02bxzcy64","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210106192"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Friedrich Kruber","raw_affiliation_strings":["Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany","institution_ids":["https://openalex.org/I4210106192"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jonas Wurst","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106192","display_name":"Technische Hochschule Ingolstadt","ror":"https://ror.org/02bxzcy64","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210106192"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jonas Wurst","raw_affiliation_strings":["Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany","institution_ids":["https://openalex.org/I4210106192"]}]},{"author_position":"last","author":{"id":null,"display_name":"Michael Botsch","orcid":null},"institutions":[{"id":"https://openalex.org/I4210106192","display_name":"Technische Hochschule Ingolstadt","ror":"https://ror.org/02bxzcy64","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210106192"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Botsch","raw_affiliation_strings":["Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Hochschule Ingolstadt, Research Center CARISSMA, Ingolstadt, Germany","institution_ids":["https://openalex.org/I4210106192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210106192"],"apc_list":null,"apc_paid":null,"fwci":4.5609,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.95881602,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2811","last_page":"2818"},"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.9955000281333923,"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.9955000281333923,"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9955000281333923,"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/T11106","display_name":"Data Management and Algorithms","score":0.9937000274658203,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/categorization","display_name":"Categorization","score":0.7321000099182129},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.67330002784729},{"id":"https://openalex.org/keywords/random-forest","display_name":"Random forest","score":0.5055000185966492},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4941999912261963},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.42179998755455017},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.4075999855995178},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.37770000100135803}],"concepts":[{"id":"https://openalex.org/C94124525","wikidata":"https://www.wikidata.org/wiki/Q912550","display_name":"Categorization","level":2,"score":0.7321000099182129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7296000123023987},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.67330002784729},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6075000166893005},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5867000222206116},{"id":"https://openalex.org/C169258074","wikidata":"https://www.wikidata.org/wiki/Q245748","display_name":"Random forest","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4941999912261963},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.42179998755455017},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.4075999855995178},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.40560001134872437},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.37770000100135803},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C111208986","wikidata":"https://www.wikidata.org/wiki/Q901698","display_name":"Distance matrix","level":2,"score":0.3621000051498413},{"id":"https://openalex.org/C39235581","wikidata":"https://www.wikidata.org/wiki/Q5158434","display_name":"Conceptual clustering","level":5,"score":0.3427000045776367},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.2791000008583069},{"id":"https://openalex.org/C82714645","wikidata":"https://www.wikidata.org/wiki/Q438331","display_name":"Template","level":2,"score":0.2694000005722046}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itsc.2018.8569682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2004.02121","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.02121","pdf_url":"https://arxiv.org/pdf/2004.02121","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.02121","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.02121","pdf_url":"https://arxiv.org/pdf/2004.02121","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2021833436","https://openalex.org/W2072343647","https://openalex.org/W2097545165","https://openalex.org/W2109799648","https://openalex.org/W2138527036","https://openalex.org/W2141807666","https://openalex.org/W2143326696","https://openalex.org/W2412593044","https://openalex.org/W2563361301","https://openalex.org/W2911964244","https://openalex.org/W6665099936","https://openalex.org/W6723137354","https://openalex.org/W6739177379","https://openalex.org/W6741472962"],"related_works":[],"abstract_inverted_index":{"A":[0],"modification":[1],"of":[2,10,67,108,121,144,161],"the":[3,8,55,65,68,75,91,116,122,145,152],"Random":[4],"Forest":[5],"algorithm":[6,27],"for":[7,157],"categorization":[9,160],"traffic":[11,99,109,134,162],"situations":[12],"is":[13,39,52,80,112,124,154],"introduced":[14],"in":[15,103,141],"this":[16,104,170],"paper.":[17,105],"The":[18,26,77,106,119,148],"procedure":[19,153],"yields":[20],"an":[21,158],"unsupervised":[22],"machine":[23],"learning":[24],"method.":[25],"generates":[28],"a":[29,34,47,98],"proximity":[30,57],"matrix":[31,38,58],"which":[32],"contains":[33],"similarity":[35],"measure.":[36],"This":[37],"then":[40],"reordered":[41],"with":[42],"hierarchical":[43],"clustering":[44],"to":[45,82,114],"achieve":[46],"graphically":[48],"interpretable":[49],"representation.":[50],"It":[51],"shown":[53],"how":[54,64],"resulting":[56],"can":[59,128,138,167],"be":[60,129,139],"visually":[61],"interpreted":[62],"and":[63],"variation":[66],"methods'":[69,92],"metaparameter":[70],"reveals":[71],"different":[72],"insights":[73],"into":[74],"data.":[76],"proposed":[78],"method":[79,123],"able":[81],"cluster":[83],"data":[84,87],"from":[85,97,132,169],"any":[86],"source.":[88],"To":[89],"demonstrate":[90],"potential,":[93],"multiple":[94],"features":[95],"derived":[96],"simulation":[100],"are":[101],"used":[102],"knowledge":[107],"scenario":[110,126],"clusters":[111],"crucial":[113],"accelerate":[115],"validation":[117],"process.":[118,147],"clue":[120],"that":[125,151],"templates":[127,137],"generated":[130],"automatically":[131],"actual":[133],"situations.":[135],"These":[136],"employed":[140],"all":[142],"stages":[143],"development":[146],"results":[149],"prove":[150],"well":[155],"suited":[156],"automatic":[159],"scenarios.":[163],"Diverse":[164],"other":[165],"applications":[166],"benefit":[168],"work.":[171]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":3}],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2018-12-22T00:00:00"}