Density-based Spatial Clustering Of Applications With Noise Algorithm Research Articles

Multi-layer access control for cloud data using improved DBSCAN, AES, homomorphic encryption, and RMAAC for text, image, and video

With the growing demand for cloud storage solutions that can handle diverse data types such as text, images, and videos, ensuring robust access control and security becomes important. This paper proposes a novel multi-layer access control framework for cloud environments, incorporating advanced Clustering Filtering Techniques with an Improved DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm to enhance search efficiency across multiple data layers. This clustering approach enables quick and accurate retrieval of text, image, and video content by efficiently organizing data based on similarity. To ensure data privacy and security, employs a hybrid encryption approach, combining Advanced Encryption Standard (AES) for data at rest and Homomorphic Encryption (HE) for data in use, allowing secure data manipulation without compromising confidentiality. The access control mechanism is further strengthened by introducing a Role-based Multi-Attribute Access Control (RMAAC) model, which grants permissions based on a user’s role, attributes, and the sensitivity level of the data being accessed. This fine-grained control restricts unauthorized access while supporting flexible policies for different data types. Simulation results demonstrate that the proposed framework significantly improves data retrieval speed, security, and clustering performance, making it an effective solution for cloud storage systems handling diverse media formats.

Research on flight intention recognition of UAVs-swarm

Abstract Most existing threat level assessments for aerial targets rely on numerical analysis and typically address only single or a few incoming targets without incorporating intention recognition. Such methods are inadequate for anti-UAV(Unmanned aerial vehicle) tasks involving large numbers of flight targets. To accurately and efficiently identify the flight intentions of UAVs-swarm, this paper proposes a method based on formation recognition and trajectory prediction. Initially, the trajectories of UAVs are obtained and clustered using the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm. For each cluster, a Bayesian classifier is employed to recognize its flight formation. Subsequently, a minimum enclosing sphere is established for each cluster, and trajectory fusion and prediction are conducted based on the sphere’s center. Finally, a flight intention recognition model is constructed. The results demonstrate that this method effectively infers the flight intentions of each UAVs-cluster, providing a robust basis for the threat level assessment in anti-UAVs-swarm tasks.

Development of HTC-DBSCAN: A Hierarchical Trajectory Clustering Algorithm with Automated Parameter Tuning

Existing route-clustering methods often fail to identify abnormal sections or similarities between routes, mainly when working with large or long datasets. While sub-route clustering can detect regional patterns, it struggles to accurately capture the overall route structure. The present study proposes a new ship route-clustering method that enhances computational efficiency and noise recognition while addressing these limitations. We refined Automatic Identification System data via four data-cleaning processes and applied a statistical distance measurement to assess ship trajectory similarity. Dimensionality reduction was then used to facilitate clustering. The clustering of ship route similarities is non-parametric and can be applied to datasets not separated based on density to find clusters of various densities. Density-Based Spatial Clustering of Applications (DBSCA) applies to many research fields; using the DBSCA with Noise (DBSCAN) algorithm, we propose an improved DBSCAN algorithm that automatically determines the parameters Epsilon and MinPts. In this study, as a core ship route-clustering process, we propose a sub-route clustering process by setting the distance and density of data points to clear standards for re-analysis and completion. The proposed approach demonstrates markedly enhanced clustering performance, offering a more sophisticated and efficient basis for ship route decision-making.

Unsupervised machine learning for local stress identification in fatigue analysis of welded joints

In the underlying study, a method has been proposed to automatically extract finite element (FE) peak stresses of welded components to alleviate human errors and increase the calculation accuracy. The approach is based on the K-means and DBSCAN (density-based spatial clustering of applications with noise) methods as the unsupervised machine learning approaches. Data points, in this case, nodal coordinates and their corresponding stress magnitudes, are grouped within different clusters. The peak stress in each dense region (cluster) is then highlighted and reported automatically. Parametric and comparative studies have also been carried out in order to detect optimised parameters of the K-means and DBSCAN algorithms. The methodology will ultimately be used for more reliable stress analysis in fatigue assessment of welded structures.

Automated matching and visualisation of magnetic flux leakage data in shale gas pipeline based on ICP and DBSCAN algorithm

ABSTRACT Magnetic flux leakage (MFL) is a non-destructive testing method for shale gas pipeline safety monitoring. Despite many pipelines have completed two or more rounds of internal inspection and have accumulated substantial data, effectively analyzing and utilizing this MFL data remains a significant challenge. To that end, this study proposes a novel combined model that integrates Iterative Closest Point (ICP) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) fusion to match multiple MFL data. The model outputs the matching result and visualisation images of MFL data acquired in different years. Furthermore, RMSE (root mean square error) and overlap rate have been used to evaluate the model. The results indicate that the average distance error of matched defects between two datasets decreased by 72.5%, and the overlap rate increased by 20%. Additionally, the DBSCAN Fusion shows better computational efficiency with an increase in defect quantity within the pipe segments. Finally, the impact of different datasets on the model’s matching accuracy is discussed in this study. The findings show that small-scale datasets or higher false detection rates lead to decreased accuracy. The proposed model fully leverages MFL data to achieve rapid matching of defects, offering a dependable and effective technical solution for safety monitoring and corrosion prediction in shale gas pipelines.

A feature sample screening and local outlier factor fusion method for detecting tidal stream turbine blade impact fault

The impact fault caused by ocean creatures poses a risk to the safe operation of tidal stream turbine blades. However, it is difficult to detect the weak impact fault directly because the collected signal is disturbed by the waves, turbulence, and continuously variable flow velocity. To solve this problem, a fusion method of feature sample screening and local outlier factor is proposed in this paper. This method consists of three main parts. First, the Teager–Kaiser energy operator and the sliding window technique are introduced to extract the envelope statistical features from the current signal. Second, a parameter optimized density-based spatial clustering of applications with noise (DBSCAN) algorithm is proposed to perform feature sample screening before detecting. Notably, the conventional DBSCAN algorithm is sensitive to the parameter selection and lacks the capability of adaptive screening, so this paper proposes an adaptive sand cat swarm optimization algorithm to optimize the parameters. Finally, the local outlier factor is utilized to detect faults based on the screened feature samples. The experimental results show that the proposed method stands out in reducing the false alarm rate compared with traditional methods. Specifically, within the flow velocity ranges of 1.0–1.3 m/s and 1.3–1.6 m/s, the false alarm rates can reach 0% and 0.17%, respectively.

A novel method for acoustic emission source location in CFRP-concrete debonding using ΔT mapping and DBSCAN algorithm

Concrete-CFRP composite structures exhibit a stiff behavior, leading to sudden failure. Monitoring the brittle nature of this failure is crucial, and the acoustic emission (AE) technique provides a promising tool for locating and classifying damage. However, the conventional source location methodology assumes that the acoustic wave travels in a straight path with constant velocity. This assumption does not hold true for concrete-CFRP composite structures, where the presence of microcracks and CFRP layers induces anisotropy and defects, altering the wave speed and traveling direction. This, in turn, introduces errors in the source location. To address these challenges, this research presents a novel source location method using ΔT maps and achieving convergence through the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. The methodology demonstrates significant improvement in AE source location when applied to concrete-CFRP composite specimens in the presence defects with varying magnitudes. Additionally, the proposed method shows effectiveness in monitoring damage progression when applied to single-lap shear tests performed on concrete specimens with attached CFRP laminate.

Spatial Patterns of Violence Against Women and Children using Geographic Information System and Density-Based Clustering Algorithm

This paper underscores the importance of the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm in data mining. In this research, data mining clustering methods were applied to investigate consummated felonies related to the "Anti-Violence Against Women and Their Children Act of 2004 - RA 9262" from 2018 to 2023. The criminal data processed from the Police Regional Office 6 of the Philippine National Police encompassed 248 attributes reflecting cases over the specified period. The significance of this study lies in its utilization of ArcGIS Pro software to process the provided data through clustering techniques, presenting a robust approach for detecting criminal activities and recognizing patterns to aid law enforcement in crime reduction efforts. Spatial data mining proves practical when dealing with geographic crime datasets, facilitating the analysis of large volumes of crime data. The DBSCAN algorithm was employed to cluster crime incidents centered on predefined events, with the resultant clusters used to identify hotspots. These clustering outcomes are then visualized using GIS, enabling real-time mapping of crime distribution for law enforcement agencies to comprehend and engage with effectively. The outcomes empower stakeholders to devise interventions tailored to specific locations, thereby contributing to a safer environment for women and children. The study illuminates the localized analysis of crime distribution, offering insights into the interconnected factors influencing criminal incidents and providing a framework for crafting targeted and efficient strategies for crime prevention, thereby enriching the broader dialogue on crime management and public safety.

GB-DBSCAN: A fast granular-ball based DBSCAN clustering algorithm

Density-Based Spatial Clustering of Applications with Noise (DBSCAN) identifies high-density connected areas as clusters, so that it has advantages in discovering arbitrary-shaped clusters. However, it has difficulty in adjusting parameters and since it needs to scan all data points in turn, its time complexity is O(n2). Granular-ball (GB) is a coarse grained representation of data. It is on the basis of the assumption that an object and its local neighbors have similar distribution and they have high possibility of belonging to the same class. It has been introduced into supervised learning by Xia et al. to improve the efficiency of supervised learning. Inspired by the idea of granular-ball, we introduce it into unsupervised learning and use it to improve the efficiency of DBSCAN, called GB-DBSCAN. The main idea of the proposed algorithm GB-DBSCAN is to employ granular-ball to represent a set of data points and then clustering on granular-balls, instead of the data points. Firstly, we use k-nearest neighbors (KNN) to generate granular-balls, which is a bottom-up strategy, and describe granular-balls according to their centers and radius. Then, the granular-balls are divided into Core-GBs and Non-Core-GBs according to their density. After that, the Core-GBs are merged into clusters according to the idea of DBSCAN and the Non-Core-GBs are assigned to the appropriate clusters. Since the granular-balls' number is much smaller than the size of the objects in a dataset, the running time of DBSCAN is greatly reduced. By comparing with KNN-BLOCK DBSCAN, RNN-DBSCAN, DBSCAN, K-means, DP and SNN-DPC algorithms, the proposed algorithm can get similar or even better clustering result in much less running time.

Estimation of the Living Vegetation Volume (LVV) for Individual Urban Street Trees Based on Vehicle-Mounted LiDAR Data

The living vegetation volume (LVV) can accurately describe the spatial structure of greening trees and quantitatively represent the relationship between this greening and its environment. Because of the mostly line shape distribution and the complex species of street trees, as well as interference from artificial objects, current LVV survey methods are normally limited in their efficiency and accuracy. In this study, we propose an improved methodology based on vehicle-mounted LiDAR data to estimate the LVV of urban street trees. First, a point-cloud-based CSP (comparative shortest-path) algorithm was used to segment the individual tree point clouds, and an artificial objects and low shrubs identification algorithm was developed to extract the street trees. Second, a DBSCAN (density-based spatial clustering of applications with noise) algorithm was utilized to remove the branch point clouds, and a bottom-up slicing method combined with the random sampling consistency iterative method algorithm (RANSAC) was employed to calculate the diameters of the tree trunks and obtain the canopy by comparing the variation in trunk diameters in the vertical direction. Finally, an envelope was fitted to the canopy point cloud using the adaptive AlphaShape algorithm to calculate the LVVs and their ecological benefits (e.g., O2 production and CO2 absorption). The results show that the CSP algorithm had a relatively high overall accuracy in segmenting individual trees (overall accuracy = 95.8%). The accuracies of the tree height and DBH extraction based on vehicle-mounted LiDAR point clouds were 1.66~3.92% (rRMSE) and 4.23~15.37% (rRMSE), respectively. For the plots on Zijin Mountain, the LVV contribution by the maple poplar was the highest (1049.667 m3), followed by the sycamore tree species (557.907 m3), and privet’s was the lowest (16.681 m3).

Research on noise reduction and data mining techniques for pavement dynamic response signals

Purpose This study aims to ensure reliable analysis of dynamic responses in asphalt pavement structures. It investigates noise reduction and data mining techniques for pavement dynamic response signals. Design/methodology/approach The paper conducts time-frequency analysis on signals of pavement dynamic response initially. It also uses two common noise reduction methods, namely, low-pass filtering and wavelet decomposition reconstruction, to evaluate their effectiveness in reducing noise in these signals. Furthermore, as these signals are generated in response to vehicle loading, they contain a substantial amount of data and are prone to environmental interference, potentially resulting in outliers. Hence, it becomes crucial to extract dynamic strain response features (e.g. peaks and peak intervals) in real-time and efficiently. Findings The study introduces an improved density-based spatial clustering of applications with Noise (DBSCAN) algorithm for identifying outliers in denoised data. The results demonstrate that low-pass filtering is highly effective in reducing noise in pavement dynamic response signals within specified frequency ranges. The improved DBSCAN algorithm effectively identifies outliers in these signals through testing. Furthermore, the peak detection process, using the enhanced findpeaks function, consistently achieves excellent performance in identifying peak values, even when complex multi-axle heavy-duty truck strain signals are present. Originality/value The authors identified a suitable frequency domain range for low-pass filtering in asphalt road dynamic response signals, revealing minimal amplitude loss and effective strain information reflection between road layers. Furthermore, the authors introduced the DBSCAN-based anomaly data detection method and enhancements to the Matlab findpeaks function, enabling the detection of anomalies in road sensor data and automated peak identification.

Investigation of the dependence of the multi-linear model parameters on the user mobility pattern in O-RAN in the context of user groups classification

The paper presents the results of a study on the influence of user mobility patterns in the O-RAN (Open Radio Access Net-work) on the parameters of a multi-linear model. The considered multi-linear model is represented as three-dimensional tensors that describe the changes of received signal power or SINR (Signal-to-Interference-plus-Noise Ratio). Factor matrices after the CP (Canonycal Polyadic) decomposition are exploited to separate users by their mobility using the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithm. A model and a set of scenarios are developed for simulating the O-RAN segments and to study the influence of the user mobility on the parameters of the multi-linear model. Simulation results indicate that the number of users in groups with different mobility patterns does not affect the parameters of the multi-linear model and the performance of the DBSCAN algorithm. For the considered scenarios, the best classification results are achieved when the order of the multi-linear model equal to three. Moreover, it is revealed that the topology of a network segment effects on the order of a multi-linear model.

Semantic sensor data annotation method for industrial scene efficiency optimization to enable digital economy

AbstractIn the digital economy era, efficiently leveraging the vast amount of sensor data generated by the Industrial Internet of Things (IIoT) is essential. This paper presents an innovative semantic annotation method for industrial sensor data, designed to optimize data processing and enhance system efficiency. Our method combines cluster analysis, ontology development, and rule‐based reasoning to automatically annotate IIoT sensory data. By utilizing data aggregation and filtering mechanisms, which incorporate the DBSCAN (Density‐Based Spatial Clustering of Applications with Noise) algorithm and a rule engine, we significantly reduce the data volume required for annotation. The Semantic Web Rule Language aids in naming new concepts and properties identified through clustering, contributing further to the automation of data processing. Experimental results, using public datasets, validate the effectiveness of our method, showing a reduction in data volume by about 20% and underscoring its potential in enhancing industrial systems' automation and overall efficiency.

Development of a Risk Space Prediction Model Based on CCTV Images Using Deep Learning: Crowd Collapse

Crowd disasters are not limited to events but can occur at any time and place where large crowds are densely gathered. The most significant factor contributing to injuries in mass gatherings is pressure. The likelihood of injuries due to pressure significantly increases when the crowd density exceeds 5-6 individuals per square meter. Once a crowd disaster occurs, it becomes challenging for rescue and medical personnel to access the affected area, potentially exacerbating the situation. However, since there is no single clear solution to address crowd disasters, there is a need for a system that can detect and analyze them in advance or in real-time. This research aims to contribute to the proactive detection and analysis of various crowd disasters, focusing on improving strategies for disaster response. In this study, we utilized a dataset of 50 videos from 35 individual incidents to propose a framework that classifies the risk levels into Crowd Crush, Crowd Wave, and Crowd Collapse. Additionally, we analyzed the feasibility of real-time detection using P2PNet (Point to Point Network), Yolo (You Only Look Once) v8, and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithms, moving away from prior still image-based detection methods. Our research outcomes provide new evidence for the feasibility of real-time detection using DBSCAN in Crowd Disaster scenarios. Moreover, the findings from this study can serve as valuable reference material for upcoming research, particularly emphasizing the algorithmic analysis of crowd collapses.

Comparison of Density-Based Spatial Clustering of Applications with Noise (DBSCAN), K-Means and X-Means Algorithms on Shopping Trends Data

This study extensively compares the efficacy of three clustering algorithms of DBSCAN, K-Means, and X-Means in analyzing shopping trend data, utilizing the Davies-Bouldin Index (DBI) for group validity assessment. The dataset, sourced from Kaggle.com, encompasses various customer attributes. Results indicate that the DBSCAN algorithm demonstrates superior cluster validity, outperforming K-Means and X-Means. Specifically, with an Eps value of 0.3 and MinPts value of 3, DBSCAN achieves an optimal DBI value of 0.1973. K-Means follows with a DBI value of 2.2958, and X-Means attains its best value (2.5663) with k=3. This research underscores the pivotal role of clustering algorithms in understanding shopping trends and customer preferences, offering valuable insights into their comparative performance.

An improvised analysis of smart data for IoT-based railway system using RFID

RFID (radio frequency identification) is a progressively adopted technology in today’s automated world. Wireless technologies have enabled contactless payments, tracking, identifying, and many more features in a system that can be introduced to build a smart environment. This work overviews the usage of the IoT (Internet of Things) platform for tracking passengers and enabling online payments through wireless sensors and RFID technology in Chennai Suburban Railways. The tracking system consists of an RFID reader that can locate and track passive as well as mobile objects attached with passive RFID tags. The proposed system incorporates the installation of RFID readers at every entrance and exit of the railway station, and every passenger carries their own RFID tags. This not only enables online payments for passengers but also helps the government in tracking the crowd for demand monitoring. The new methodology creates a digital workspace and enforces lawful safety regulations both for the administration and the consumers. A prototype of the proposed system is implemented in real-time to understand the workings of the system. Data collection is done through RFID tags that act as transit cards and an analysis for consumer demand is done using the DBSCAN (Density-Based Spatial Clustering of Application with Noise) algorithm with a Randomized KD-tree for the analysis of spatial and temporal patterns. A new algorithm, the iDBSCAN (improved Density-Based Spatial Clustering of Application with Noise) algorithm is proposed for faster performance on the datasets.

Based on Correlation Analysis and K-Means: An Anomaly Detection Algorithm for Seasonal Time- Series Data

Anomaly detection is widely used in fields like data processing, intrusion detection, and financial fraud prevention, helping to avoid potential accidents and economic losses. In time series anomaly detection, which deals with numerical sequences over time (e.g., urban temperatures, sales data, stock market trends), the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm is an excellent choice. This paper presents an improved anomaly detection algorithm tailored for seasonal time series data. By combining autocorrelation coefficients with the K-means algorithm, precise clustering results down to the date level are provided, subsequently employing the DBSCAN algorithm for detection, the enhanced algorithm is capable of capturing a greater number of local anomalies. Experiment conducted on daily temperature data from Beijing and Sanya in 2023, the enhanced algorithm exhibited a respective increase of 11.6% and 78% in anomaly detection compared to the original algorithm, thus affirming the feasibility of the approach.

A novel machine learning model for perimeter intrusion detection using intrusion image dataset.

Perimeter Intrusion Detection Systems (PIDS) are crucial for protecting any physical locations by detecting and responding to intrusions around its perimeter. Despite the availability of several PIDS, challenges remain in detection accuracy and precise activity classification. To address these challenges, a new machine learning model is developed. This model utilizes the pre-trained InceptionV3 for feature extraction on PID intrusion image dataset, followed by t-SNE for dimensionality reduction and subsequent clustering. When handling high-dimensional data, the existing Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm faces efficiency issues due to its complexity and varying densities. To overcome these limitations, this research enhances the traditional DBSCAN algorithm. In the enhanced DBSCAN, distances between minimal points are determined using an estimation for the epsilon values with the Manhattan distance formula. The effectiveness of the proposed model is evaluated by comparing it to state-of-the-art techniques found in the literature. The analysis reveals that the proposed model achieved a silhouette score of 0.86, while comparative techniques failed to produce similar results. This research contributes to societal security by improving location perimeter protection, and future researchers can utilize the developed model for human activity recognition from image datasets.

Clustering of students admission data using k-means, hierarchical, and DBSCAN algorithms

Admissions in the university undergo procedures and requirements before a student can be officially enrolled. The senior high school grades remain the most significant in college admission decisions. This paper presents the use of data mining to cluster students based on admission datasets. The admission dataset for 2019-2020 was obtained from the office of student affairs and services. This dataset contains 2,114 observations with 11 attributes. Data preparation and data standardization were performed to ensure that the dataset is ready for processing and implemented in R programming language. The optimal number of clusters (k) was identified using the silhouette method. This method gave an optimal number of k=2 which was used in the actual clustering using the k-means and hierarchical clustering algorithms. Both algorithms were able to cluster students into two: cluster 1-social sciences or board courses and cluster 2-management or non-board courses. Further, density-based spatial clustering of applications with noise (DBSCAN) clustering algorithm was also used on the same dataset and it yielded a single cluster. This study can be replicated by using at least a 5-year dataset of students’ admission data employing other algorithms that would suggest students’ retention and turn over to board examinations.

Investigating Pedestrian Crossing Patterns at Crossing Locations Based on Trajectory Data Collected by UAV

Previous studies on pedestrian crossing have mostly focused on pedestrian crossing decisions; while as an important behavioral aspect, the pedestrian crossing process, i.e., their motions during the entire crossing process, has been narrowly studied. Understanding how pedestrian moves across the street during their entire crossing process helps identify risky movements and reasons for such movements, which can further help in the implementation of effective countermeasures. Therefore, this paper proposed a new and easily applied approach for investigating and understanding the pattern of the pedestrian crossing process at crosswalks based on vision-based trajectory tracking technology and UAV (unmanned aerial vehicle) data. This study uses UAV for collecting video data which is timesaving and has a sufficient coverage area, compared to other methods. For trajectory extraction, the vision-based Deep-SORT-Yolov5 architecture is applied. An improved DBSCAN (density-based spatial clustering of applications with noise) algorithm is introduced for clustering and identification of patterns of pedestrian crossing processes based on their trajectories. This approach is tested via a case study involving six marked crosswalks in Shanghai, China. By using the proposed method, different crossing patterns are extracted and compared. The results show reasonable outputs of trajectory patterns, which reasonably explain the potential instincts of the pedestrians and affecting factors on the behavior of the pedestrian crossing process. Suggestions are made based on the results. This paper contributes to a more comprehensive safety analysis of pedestrian crossings by considering the pedestrian crossing process. The model, along with the UAV-based trajectory observation method, provides an easily-applied and low-cost way of traffic data collection for the purpose of pedestrian safety evaluation.