Clustering Algorithms to Analyze the Road Traffic Crashes
- URL: http://arxiv.org/abs/2108.03490v1
- Date: Sat, 7 Aug 2021 17:37:41 GMT
- Title: Clustering Algorithms to Analyze the Road Traffic Crashes
- Authors: Mahnaz Rafia Islam, Israt Jahan Jenny, Moniruzzaman Nayon, Md. Rajibul
Islam, Md Amiruzzaman, M. Abdullah-Al-Wadud
- Abstract summary: This paper analyzes shortcomings of different existing techniques applied to cluster accident-prone areas.
It recommends using Density-Based Spatial Clustering of Applications with Noise (DBSCAN) and Ordering Points To Identify the Clustering Structure (OPTICS) to overcome them.
- Score: 0.4697611383288171
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Selecting an appropriate clustering method as well as an optimal number of
clusters in road accident data is at times confusing and difficult. This paper
analyzes shortcomings of different existing techniques applied to cluster
accident-prone areas and recommends using Density-Based Spatial Clustering of
Applications with Noise (DBSCAN) and Ordering Points To Identify the Clustering
Structure (OPTICS) to overcome them. Comparative performance analysis based on
real-life data on the recorded cases of road accidents in North Carolina also
show more effectiveness and efficiency achieved by these algorithms.
Related papers
- A3S: A General Active Clustering Method with Pairwise Constraints [66.74627463101837]
A3S features strategic active clustering adjustment on the initial cluster result, which is obtained by an adaptive clustering algorithm.
In extensive experiments across diverse real-world datasets, A3S achieves desired results with significantly fewer human queries.
arXiv Detail & Related papers (2024-07-14T13:37:03Z) - Fuzzy K-Means Clustering without Cluster Centroids [79.19713746387337]
Fuzzy K-Means clustering is a critical computation technique in unsupervised data analysis.
This paper proposes a novel Fuzzy K-Means clustering algorithm that entirely eliminates the reliance on cluster centroids.
arXiv Detail & Related papers (2024-04-07T12:25:03Z) - Categorizing Flight Paths using Data Visualization and Clustering
Methodologies [12.270546709771926]
This work leverages the U.S. Federal Aviation Administration's Traffic Flow Management System dataset and DV8 to develop clustering algorithms for categorizing air traffic by their varying flight paths.
Examples of applications reveal successful, realistic clustering based on automated clustering result determination and human-in-the-loop processes.
arXiv Detail & Related papers (2023-10-01T19:42:00Z) - Neural Capacitated Clustering [6.155158115218501]
We propose a new method for the Capacitated Clustering Problem (CCP) that learns a neural network to predict the assignment probabilities of points to cluster centers.
In our experiments on artificial data and two real world datasets our approach outperforms several state-of-the-art mathematical and solvers from the literature.
arXiv Detail & Related papers (2023-02-10T09:33:44Z) - A One-shot Framework for Distributed Clustered Learning in Heterogeneous
Environments [54.172993875654015]
The paper proposes a family of communication efficient methods for distributed learning in heterogeneous environments.
One-shot approach, based on local computations at the users and a clustering based aggregation step at the server is shown to provide strong learning guarantees.
For strongly convex problems it is shown that, as long as the number of data points per user is above a threshold, the proposed approach achieves order-optimal mean-squared error rates in terms of the sample size.
arXiv Detail & Related papers (2022-09-22T09:04:10Z) - POCS-based Clustering Algorithm [0.0]
A novel clustering technique based on the projection onto convex set (POCS) method, called POCS-based clustering algorithm, is proposed in this paper.
The proposed POCS-based clustering algorithm exploits a parallel projection method of POCS to find appropriate cluster prototypes in the feature space.
The performance of the proposed POCS-based clustering algorithm is verified through experiments on various synthetic datasets.
arXiv Detail & Related papers (2022-08-15T12:33:09Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Trajectory Clustering Performance Evaluation: If we know the answer,
it's not clustering [0.6472434306724609]
Trajectory clustering is an unsupervised task.
We perform a comprehensive comparison of similarity measures, clustering algorithms and evaluation measures using trajectory data from seven intersections.
arXiv Detail & Related papers (2021-12-02T19:25:38Z) - A self-adaptive and robust fission clustering algorithm via heat
diffusion and maximal turning angle [4.246818236277977]
A novel and fast clustering algorithm, fission clustering algorithm, is proposed in recent year.
We propose a robust fission clustering (RFC) algorithm and a self-adaptive noise identification method.
arXiv Detail & Related papers (2021-02-07T13:16:47Z) - Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
Existing scalable hierarchical clustering methods sacrifice quality for speed.
We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
arXiv Detail & Related papers (2020-10-22T15:58:35Z) - Tracking Road Users using Constraint Programming [79.32806233778511]
We present a constraint programming (CP) approach for the data association phase found in the tracking-by-detection paradigm of the multiple object tracking (MOT) problem.
Our proposed method was tested on a motorized vehicles tracking dataset and produces results that outperform the top methods of the UA-DETRAC benchmark.
arXiv Detail & Related papers (2020-03-10T00:04:32Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.