Comparison of Trajectory Clustering Methods based on K-means and DBSCAN

A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm

The problem of anomaly detection in marine Argo data is studied. Based on the common and widely used DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm for anomaly detection in Argo data, as in other fields, there is a major problem in the application of DBSCAN algorithm, which is how to choose the appropriate parameter pairs. To solve this problem, this paper proposes an improved version of DBSCAN, namely CCMD-DBSCAN (DBSCAN based on the classification characteristics of marine data), which solves the above problem by studying the characteristics and laws of Argo data and is successfully applied to anomaly detection of marine data. The experimental results show that the new algorithm can not only determine the appropriate parameter pairs but also has a good anomaly detection effect.KeywordsArgoDBSCANAnomaly detection

In data-intensive environment, data mining and data analysis is a big challenge. It analyses basic algorithms, such as k-means algorithm and Density-Based Spatial Clustering of Applications with Noise (DBSCAN). And both algorithms are implemented on MapReduce of Hadoop. Further, an improved Data-intensive Density Base Distributed Clustering (IDBDC) algorithm is proposed which are based on k-means algorithm and DBSCAN algorithm. And IDBDC algorithm is implemented on MapReduce of Hadoop as well. The experimental results show that the improved IDBDC algorithm has better performance.

Clustering algorithm is one of the most important algorithms in unsupervised learning. For density‐based spatial clustering of applications with noise (DBSCAN) density clustering algorithm, the selection of neighborhood radius and minimum number is the key to get the best clustering results. Aiming at the problems of traditional DBSCAN algorithm, such as the neighborhood radius and the minimum number of points, this article puts forward two classifications based on K‐means algorithm, and gets two clustering centers. Where calculated between two data points and the cluster center‐to ‐center distance, clustering, distance, statistics in a distance of data points within the scope of the search, the number of data points corresponding to the maximum distance value, and thus the parameters for the DBSCAN algorithm to estimate and selection of initial radius of neighborhood with the minimum number of clustering start critical value. When the parameters are iterated and optimized continuously, the data are divided into clusters, and the most suitable neighborhood radius and the minimum point number are obtained. The experimental data analysis show that the improved algorithm reduces the human factors in the traditional algorithm and improves the efficiency, so as to get the accurate clustering results.

The density based notion for clustering approach is used widely due to its easy implementation and ability to detect arbitrary shaped clusters in the presence of noisy data points without requiring prior knowledge of the number of clusters to be identified. Density-based spatial clustering of applications with noise (DBSCAN) is the first algorithm proposed in the literature that uses density based notion for cluster detection. Since most of the real data set, today contains feature space of adjacent nested clusters, clearly DBSCAN is not suitable to detect variable adjacent density clusters due to the use of global density parameter neighborhood radius Nrad and minimum number of points in neighborhood Npts. So the efficiency of DBSCAN depends on these initial parameter settings, for DBSCAN to work properly, the neighborhood radius must be less than the distance between two clusters otherwise algorithm merges two clusters and detects them as a single cluster. Through this paper: 1) We have proposed improved version of DBSCAN algorithm to detect clusters of varying density adjacent clusters by using the concept of neighborhood difference and using the notion of density based approach without introducing much additional computational complexity to original DBSCAN algorithm. 2) We validated our experimental results using one of our authors recently proposed space density indexing (SDI) internal cluster measure to demonstrate the quality of proposed clustering method. Also our experimental results suggested that proposed method is effective in detecting variable density adjacent nested clusters.

In recent years, the clustering of multi-density data has been a research hotspot. As a widely applied clustering algorithm, density-based spatial clustering of application with noise (DBSCAN) algorithm can avoid the interference of noise data, and has the ability to find clusters of any shape. However, the DBSCAN algorithm used hyperparameter (e.g., eps, MinPts), which makes the clusters of different densities cannot be identified. Furthermore, when the algorithm is applied to different datasets, the clustering quality would decrease severely. To cope with the above problems, we propose an improved and heuristic-based iterative DBSCAN clustering algorithm. The new algorithm realizes flexible clustering of the data with different densities by MinPts. In particular, we first estimate the values of MinPts according to the user area densities, then the new clustering is carried out based on the MinPts. This method avoids too dense clusters. In the experiments, Silhouette Coefficient and purity are adopted to evaluate the clustering effect of the improved DBSCAN algorithm. It is demonstrated that the proposed algorithm can effectively cluster multi-density data, and has greater adaptability and clustering performance to all kinds of data.

<span lang="EN-US">Automatic identification system (AIS) is a vessel radio navigation equipment that has been determined by international maritime organization (IMO). Historical AIS data can be utilized for anomaly detection, trajectory prediction, and vessel trajectory planning. These benefits can be achieved by identifying the vessel's trajectory pattern through trajectory clustering. However, more effort is needed in trajectory clustering using AIS data due to their large volume and the significant number of deficiencies. In addition, trajectory clustering cannot be directly applied to trajectory data, which also applies to vessel trajectory. Therefore, we propose a trajectory clustering framework by combining douglas peucker (DP), longest common subsequence (LCSS), multi-dimensional scaling (MDS), and density-based spatial clustering of applications with noise (DBSCAN). Our experiments, carried out with AIS data for the Lombok Strait, Indonesia, showed that the trajectory compression with DP significantly accelerates the similarity measurement process. Moreover, we found that the LCSS is the optimal algorithm for similarity measurement of vessel trajectories based on AIS data. We also applied the right combination of MDS and DBSCAN in density-based clustering. The proposed framework can distinguish trajectoriess in different directions, identify the noise, and produce good quality clusters in relatively fast total processing time.</span>

The vibration and friction triggered by the long-term operation of stacker inevitably lead to the damage problem of stacker’s track. In order to ensure the stable operation of the stacker, a novel scheme is proposed to address an accurate damage localization problem of the stacker’s track in industrial environment based on ensemble empirical mode decomposition-empirical mode decomposition (EEMD-EMD) and density-based spatial clustering of applications with noise (DBSCAN). First, the original electric current signal with unbalanced distribution is processed by fixed-interval smoothing and cubic Hermite interpolation algorithms. Second, the EEMD-EMD method, which solves the mode-mixing problem, is adopted to decompose the preprocessed signal into well-defined intrinsic mode functions (IMFs). Third, based on Hilbert–Huang transform (HHT) of the IMFs, the preprocessed signal and the difference of average instantaneous amplitudes in two adjacent time points are considered as the 2-D feature vector input of the DBSCAN algorithm. As such, damage locations of the stacker’s track are detected by means of the outliers that are obtained by the DBSCAN algorithm. The efficiency of the proposed localization scheme and its superiority over the existing cooperative damage localization methods, namely, the box-plot method, the pulse coupling neural network (PCNN) and wavelet transform (WT) theory method, and the box-plot and WT method, are verified through experiments using the data provided by State Grid Measuring Center of China.

In fingerprint-based localization systems, clustering fingerprint databases is a proposed technique for improving localization accuracy while reducing localization time. Among various clustering algorithms, density-based spatial clustering of applications with noise (DBSCAN) stands out for its robustness to outliers and ability to accommodate fingerprint databases of various shapes. However, the clustering performance of the DBSCAN algorithm is heavily influenced by the type of similarity measure metric used, with most researchers using distance-based metrics. This paper aims to enhance DBSCAN clustering by using a pattern-based metric known as the context similarity coefficient (CSC) instead of distance-based metrics. The CSC metric examines received signal strength (RSS) measurement patterns that form fingerprint vectors and assesses both linear and non-linear relationships between these vectors to determine similarity. Four publicly available fingerprint databases were used to evaluate the clustering performance with silhouette scores as a performance metric. The performance of the DBSCAN algorithm with the CSC metric is determined and compared to Euclidean and Manhattan distances as similarity measure metrics. Simulation results indicate that achieving good clustering performance with the DBSCAN algorithm requires generating three or fewer clusters. The proposed CSC metric demonstrated the best clustering performance in two of four fingerprint databases and the second-best in another. However, computational complexity comparisons reveal that the CSC metric is highly computationally intensive and is suggested to be used on small to medium-sized fingerprint databases generated using an odd number of wireless APs deployed in a non-uniform or non-grid-like distribution.

Revised DBSCAN algorithm to cluster data with dense adjacent clusters

Density-Based Spatial Clustering of Application with Noise (DBSCAN) is a well-known, unsupervised machine learning tool for clustering. DBSCAN creates clusters based on dense regions while marking points that lie alone in low-density regions as outliers. In DBSCAN, the density is detected via core points which are quite sensitive to input parameters: ϵ is radius of the neighborhood and MinPts is minimum number of points constraint within ϵ radius. In contrast to crisp core point definition, intuitionistic fuzzy core point definition makes DBSCAN algorithm capable to detect different patterns of density by two different combinations of input parameters. In this study, a DBSCAN extension is proposed based on this idea: IFDBSCAN. The proposed extension is then illustrated by a computational experiment on a synthetic dataset. Results show that, IFDBSCAN can establish fine-tuned clusters relatively to classical DBSCAN and provide users more insight on the estimation of input parameters.

An efficient and scalable density-based clustering algorithm for datasets with complex structures

Design of computationally efficient density-based clustering algorithms

This study investigates the application of maritime trajectory clustering in the Straits of Malacca and Singapore (SOMAS), aiming to identify and categorize key movement patterns in this densely trafficked and complex region. Using Automatic Identification System (AIS) data, the research employs Dynamic Time Warping (DTW) to measure trajectory similarity and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) for clustering. Due to the wide variation in trajectory lengths across the region, a statistical grouping technique based on the interquartile range (IQR) is applied to improve clustering performance and manage trajectory diversity. The results demonstrate the successful identification of major traffic routes within the study area, providing valuable insights into dominant vessel movement behaviours and navigation patterns. These findings are essential for supporting maritime traffic analysis, thereby enhancing safe, efficient, and sustainable traffic management in high-density international waterways.

Tremendous growth of Location-based technologies resulted in the generation of a huge volume of spatial data, which needs to be analyzed to get potentially important patterns. The spatial patterns extracted can be used to design a better infrastructure ensuring reliable service coverage. Trajectory data is one variant of spatial data that are generated by moving objects travelling across. It is represented as a sequence of spatial coordinates (latitude, longitude) of a location. Trajectory clustering tries to group similar spatial data points to extract the most common movement behaviors. Trajectory data poses major challenges including uncertainty, sampling rate, representation, relationships, spatial autocorrelation, serialization, redundancy, and triviality, which makes it hard to apply traditional clustering algorithms over trajectory data. In this paper, K-Means and DBSCAN (Density-based spatial clustering of applications with noise) clustering algorithms are analyzed using different similarity measures like Euclidean, Hausdorff and Haversine distances with the help of index measures say Adjusted Rand Index (ARI) and Fowlkes-Mallows scores (FMS). Experiment is carried out over two different trajectory datasets and it is proved that usage of Haversine distance for clustering is efficient than Euclidean and Hausdorff distances in terms of spatial trajectory data.