A modification of the Random Forest algorithm for the categorization of traffic situations is introduced in this paper. The procedure yields an unsupervised machine learning method. The algorithm generates a proximity matrix which contains a similarity measure. This matrix is then reordered with hierarchical clustering to achieve a graphically interpretable representation. It is shown how the resulting proximity matrix can be visually interpreted and how the variation of the methods' metaparameter reveals different insights into the data. The proposed method is able to cluster data from any data source. To demonstrate the methods' potential, multiple features derived from a traffic simulation are used in this paper. The knowledge of traffic scenario clusters is crucial to accelerate the validation process. The clue of the method is that scenario templates can be generated automatically from actual traffic situations. These templates can be employed in all stages of the development process. The results prove that the procedure is well suited for an automatic categorization of traffic scenarios. Diverse other applications can benefit from this work.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Unsupervised Random Forest Clustering Technique for Automatic Traffic Scenario Categorization


    Contributors:


    Publication date :

    2018-11-01


    Size :

    548763 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Unsupervised Random Forest Learning for Traffic Scenario Categorization

    Kruber, Friedrich / Wurst, Jonas / Botsch, Michael et al. | Springer Verlag | 2023



    Unsupervised image categorization

    Heidemann, G. | British Library Online Contents | 2005



    TRAFFIC SCENARIO CLUSTERING BY ITERATIVE OPTIMISATION OF SELF-SUPERVISED NETWORKS USING A RANDOM FOREST ACTIVATION PATTERN SIMILARITY

    Balasubramanian, Lakshman / Wurst, Jonas / Botsch, Michael et al. | British Library Conference Proceedings | 2021