Given a road network and a set of trajectory data, the anomalous behavior detection (ABD) problem is to identify drivers that show significant directional deviations, hard-brakings, and accelerations in their trips. The ABD problem is important in many societal applications, including Mild Cognitive Impairment (MCI) detection and safe route recommendations for older drivers. The ABD problem is computationally challenging due to the large size of temporally-detailed trajectories dataset. In this paper, we propose an Edge-Attributed Matrix that can represent the key properties of temporally-detailed trajectory datasets and identify abnormal driving behaviors. Experiments using real-world datasets demonstrated that our approach identifies abnormal driving behaviors.
more »
« less
This content will become publicly available on December 4, 2024
Abnormal Driving Detection Using GPS Data
Given a GPS dataset comprising driving records captured at one-second intervals, this research addresses the challenge of Abnormal Driving Detection (ADD). The study introduces an integrated approach that leverages data preprocessing, dimensionality reduction, and clustering techniques. Speed Over Ground (SOG), Course Over Ground (COG), longitude (lon), and latitude (lat) data are aggregated into minute-level segments. We use Singular Value Decomposition (SVD) to reduce dimensionality, enabling K-means clustering to identify distinctive driving patterns. Results showcase the methodology's effectiveness in distinguishing normal from abnormal driving behaviors, offering promising insights for driver safety, insurance risk assessment, and personalized interventions.
more »
« less
- Award ID(s):
- 1844565
- NSF-PAR ID:
- 10487844
- Publisher / Repository:
- IEEE
- Date Published:
- Journal Name:
- IEEE 20th International Conference on Smart Communities: Improving Quality of Life using AI, Robotics and IoT (HONET)
- ISSN:
- 1949-4092
- ISBN:
- 979-8-3503-3111-0
- Page Range / eLocation ID:
- 1 to 6
- Format(s):
- Medium: X
- Location:
- Boca Raton, FL, USA
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Self-driving vehicles are very susceptible to cyber attacks. This paper aims to utilize a machine learning approach in combating cyber attacks on self-driving vehicles. We focus on detecting incorrect data that are injected into the data bus of vehicles. We will utilize the extreme gradient boosting approach, as a promising example of machine learning, to classify such incorrect information. We will discuss in details the research methodology, which includes acquiring the driving data, preprocessing it, artificially inserting incorrect information, and finally classifying it. Our results show that the considered algorithm achieve accuracy of up to 92% in detecting the abnormal behavior on the car data bus.more » « less
-
Effective management of social-ecological systems (SESs) requires an understanding of human behavior. In many SESs, there are hundreds of agents or more interacting with governance and regulatory institutions, driving management outcomes through collective behavior. Agents in these systems often display consistent behavioral characteristics over time that can help reduce the dimensionality of SES data by enabling the assignment of types. Typologies of resource-user behavior both enrich our knowledge of user cultures and provide critical information for management. Here, we develop a data-driven framework to identify resource-user typologies in SESs with high-dimensional data. To demonstrate policy applications, we apply the framework to a tightly coupled SES, commercial fishing. We leverage large fisheries-dependent datasets that include mandatory vessel logbooks, observer datasets, and high-resolution geospatial vessel tracking technologies. We first quantify vessel and behavioral characteristics using data that encode fishers’ spatial decisions and behaviors. We then use clustering to classify these characteristics into discrete fishing behavioral types (FBTs), determining that 3 types emerge in our case study. Finally, we investigate how a series of disturbances applied selection pressure on these FBTs, causing the disproportionate loss of one group. Our framework not only provides an efficient and unbiased method for identifying FBTs in near real time, but it can also improve management outcomes by enabling ex ante investigation of the consequences of disturbances such as policy actions.more » « less
-
more » « less
Motivated by applications to classification problems on metric data, we study Weighted Metric Clustering problem: given a metric d over n points and a k x k symmetric matrix A with non-negative entries, the goal is to find a k-partition of these points into clusters C1,...,Ck, while minimizing the sum of A[i,j] * d(u,v) over all pairs of clusters Ci and Cj and all pairs of points u from Ci and v from Cj. Specific choices of A lead to Weighted Metric Clustering capturing well-studied graph partitioning problems in metric spaces, such as Min-Uncut, Min-k-Sum, Min-k-Cut, and more.Our main result is that Weighted Metric Clustering admits a polynomial-time approximation scheme (PTAS). Our algorithm handles all the above problems using the Sherali-Adams linear programming relaxation. This subsumes several prior works, unifies many of the techniques for various metric clustering objectives, and yields a PTAS for several new problems, including metric clustering on manifolds and a new family of hierarchical clustering objectives. Our experiments on the hierarchical clustering objective show that it better captures the ground-truth structural information compared to the popular Dasgupta's objective.
-
Data visualizations can reveal trends and patterns that are not otherwise obvious from the raw data or summary statistics. While visualizing low-dimensional data is relatively straightforward (for example, plotting the change in a variable over time as (x,y) coordinates on a graph), it is not always obvious how to visualize high-dimensional datasets in a similarly intuitive way. Here we present HypeTools, a Python toolbox for visualizing and manipulating large, high-dimensional datasets. Our primary approach is to use dimensionality reduction techniques (Pearson, 1901; Tipping & Bishop, 1999) to embed high-dimensional datasets in a lower-dimensional space, and plot the data using a simple (yet powerful) API with many options for data manipulation [e.g. hyperalignment (Haxby et al., 2011), clustering, normalizing, etc.] and plot styling. The toolbox is designed around the notion of data trajectories and point clouds. Just as the position of an object moving through space can be visualized as a 3D trajectory, HyperTools uses dimensionality reduction algorithms to create similar 2D and 3D trajectories for time series of high-dimensional observations. The trajectories may be plotted as interactive static plots or visualized as animations. These same dimensionality reduction and alignment algorithms can also reveal structure in static datasets (e.g. collections of observations or attributes). We present several examples showcasing how using our toolbox to explore data through trajectories and low-dimensional embeddings can reveal deep insights into datasets across a wide variety of domains.more » « less
