Enhanced Botnet Detection and Neutralization through Machine Learning: A Synergistic Analysis of Host Activity, Network Patterns with Explainable Insights

Optofluidic time-stretch imaging system has enabled high-throughput phenotyping of cells with unprecedented high speed and resolution. However, significant amount of raw image data is produced, which requires recognition algorithm with not only high accuracy but also high speed to analyze image data efficiently. In this paper, we compare the performance of popular feature extraction methods and learning-based classification algorithms on time-stretch microscopy image recognition. The applied image recognition system comprises an outlier detection step, feature extraction method and classification. The main concept of outlier detection uses DBSCAN (Density-Based Spatial Clustering of Applications with Noise) to eliminate error images. Gabor wavelet, HOG (Histograms of Oriented Gradients), LBP (Local Binary Pattern) and PCA (Principal Components Analysis) are applied and compared as the feature extraction methods. Finally, with a set of extracted features, the computing time and accuracy of SVM (Support Vector Machines), LR (Logistics Regression), ResNet (Residual Neural Network) and XGBoost (Extreme Gradient Boosting) classification algorithms are evaluated. The tested cell image datasets are acquired from high-throughput imaging of numerous drug-treated and untreated cells (N = ~21,000) with an optofluidic time-stretch microscope. Results show that PCA feature extraction and XGBoost classification proves to be the fastest algorithms with the highest level of accuracy. DBSCAN outlier detection helps to improve the recognition accuracy by 2% approximately. Therefore, we propose a recognition algorithm consisting of DBSCAN outlier detection, PCA feature extraction and XGBoost classification as a promising solution to process the image data of high-throughput optofluidic time-stretch microscopy accurately and rapidly.

Ensuring the security of communication is crucial in Vehicular Ad Hoc Networks (VANETs) to protect the integrity of information sharing among cars. To implement VANET communication as an answer for the different uses, secure communication is necessary. The unreliability of VANET environments is caused by message delays or tampering in VANET applications. Finding the sweet spot between VANET security and performance and dependability is the primary goal. This project’s overarching goal is to fortify VANETs against Blackhole Routing Attacks and, by identifying and blocking harmful nodes, to mitigate the blackhole impact. This paper proposes a robust hybrid approach for the detection of black hole attacks in VANETs, leveraging the synergy between DBSCAN (Density-Based Spatial Clustering of Applications with Noise) clustering and Decision Trees. DBSCAN, a density-based clustering algorithm, is employed to identify spatial clusters of vehicles, while Decision Trees are utilized to discern normal communication patterns from malicious ones within these clusters. The integration of these two techniques enhances the accuracy and efficiency of black hole attack detection in the dynamic and resource-constrained VANET environment. Experimental results demonstrate the effectiveness of the proposed hybrid approach, providing a promising solution for bolstering the security of VANETs against emerging threats. Here in result 73.89% improvement is received in Packet Drop Rate using DBSCAN, also minor improvement over Throughput and Average end to end delay and major improvement in terms of Network Routing Load.

Investing in the stock market is challenged by high volatility, which often leads to inaccurate price predictions. Prediction models often struggle to handle the fluctuation phenomenon and produce unstable forecasts. This study aims to predict stock prices in three banks, namely PT Bank Central Asia Tbk (BBCA), PT Bank Rakyat Indonesia (Persero) Tbk (BBRI), and PT Bank Mandiri (Persero) Tbk (BMRI) using Long Short-Term Memory (LSTM) with the integration of Density-Based Spatial Clustering of Applications with Noise (DBSCAN) for anomaly detection. DBSCAN is applied with an epsilon (ε) of 0.5 and a minimum of 5 samples using Euclidean distance. The LSTM model consists of two hidden layers with 50 units, optimized using Adam, and applying the Mean Squared Error (MSE) loss function. The results show that DBSCAN improves prediction accuracy under several conditions. For BBCA stock, the lowest MSE was 0.003 at the 2nd fold with DBSCAN compared to 0.006 without DBSCAN. For BMRI stock achieved an MSE of 0.003 at the 4th fold with DBSCAN, while the 5th fold without DBSCAN obtained 0.000. For BBRI stock showed the best MSE of 0.003 at the 2nd fold with DBSCAN and the 5th fold without DBSCAN. These results show that the integration of DBSCAN can improve prediction especially when extreme price fluctuations occur. This research contributes to the development of stock price prediction methods that can be one of the benchmarks for investors before making decisions so that they do not experience losses.

Density-based spatial clustering of applications with noise (DBSCAN) is the most commonly used density-based clustering algorithm, where it can discover multiple clusters with arbitrary shapes. DBSCAN works properly when the input data type is homogeneous, but the DBSCAN's approach may not be sufficient when the input dataset has textual heterogeneity (e.g., when we intend to find clusters from geo-tagged posts on social media relevant to a certain point-of-interest (POI)), thus leading to poor performance. In this paper, we present DBSTexC, a new density-based clustering algorithm using spatio--textual information on Twitter. We first define POI-relevant and POI-irrelevant tweets as the records that contain and do not contain a POI name or its coherent variations, respectively. By taking into account the fractions of POI-relevant and POI-irrelevant tweets, our DBSTexC algorithm shows a much higher clustering quality than the DBSCAN case in terms of the F1 score and its variants. DBSTexC can be thought of as a generalized version of DBSCAN due to the findings that it performs identically as DBSCAN when the inputs are homogeneous and far outperforms DBSCAN when the heterogeneous input data type is given.

In the urban transportation system, the unbalanced relationship between taxi demand and the number of running taxis reduces the drivers' income and the levels of passengers' satisfaction. With the help of vehicular global positioning system (GPS) data, the taxi demand distribution of city can be analyzed to provide advice for drivers. A clustering algorithm called Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is suitable for discovering demand hotspots. However, the execution efficiency is still a big challenge when DBSCAN is applied on big databases. In this paper, we propose an improved density-based clustering algorithm called Grid and Kd-tree for DBSCAN (GD-DBSCAN), which integrates partitioning method with kd-tree structure to improve the computational performance of DBSCAN. Furthermore, this algorithm can take advantages of multi cores and shared memory to parallelize related functions. The experiment shows GD- DBSCAN is efficient, it has an improvement of at least 10% in performance compared with DBSCAN.

A significant challenge for the growing world of data is to analyze, classify and manipulate spatial data. The challenge starts with the clustering process, which can be defined to characterize the spatial data with their relative properties in different groups or classes. This process can be performed using many different methods like grids, density, hierarchical and others. Among all these methods, the use of density for grouping leads to a lower noise data in result, which is called Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The DBSCAN algorithm defines a data set in a group and separates the group from the other groups based on the density of the data surrounding the selection of data points. These data points and the density of the data are calculated depending on two parameters. One parameter is used as the radius of the data point to find the neighborhood data points. Another parameter is used to identify the noise in the collected data by keeping the minimum number of data points for the data density. Like other popular method k-means, DBSCAN does not require any input of the cluster number. It can sort the data set with the number of clusters according to data density. The purpose of this article is to explain the Efficient Density-based Spatial Clustering of Applications with Noise (DBSCAN) using a sample of data set, compare the results, identify the constraints, and suggest some possible solutions.

Most clustering algorithms considering spatial characteristics of data have been developed based on the geological location of observations. Density-based spatial clustering of applications with noise (DBSCAN) provides arbitrarily shaped clusters grouping a set of observations which are closely packed together and noise detecting outliers which lie alone in low-density regions. A distance measure for DBSCAN is Euclidean distance, which is the standard measure of distance and especially suitable to handle continuous variables. To handle both categorical and continuous variables simultaneously, other measures are required to compute distance for various types of variables. Thus, we propose DBSCAN algorithm using Gower distance. We provide numerical results on spatial and non-spatial setup comparing DBSCAN methods with Euclidean and Gower distance and we apply this method to land price data and migraine treatments data. DBSCAN using Gower distance has a reasonable method and gives comparably stable results.

The density-based spatial clustering of applications with noise (DBSCAN) is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To address this issue, a parameter-adaptive DBSCAN clustering algorithm based on the Sparrow Search Algorithm (SSA), referred to as SSA-DBSCAN, is proposed. This method leverages the local fast search ability of SSA, using the optimal number of clusters and the silhouette coefficient of the dataset as the objective functions to iteratively optimize and select the two input parameters of DBSCAN. This avoids the adverse impact of manually inputting parameters, enabling adaptive clustering with DBSCAN. Experiments on typical synthetic datasets, UCI (University of California, Irvine) real-world datasets, and image segmentation tasks have validated the effectiveness of the SSA-DBSCAN algorithm. Comparative analysis with DBSCAN and other related optimization algorithms demonstrates the clustering performance of SSA-DBSCAN.

A density-based spatial clustering of applications with noise (DBSCAN) and three distances (TD) integrated Wi-Fi positioning algorithm was proposed, aiming to enhance the positioning accuracy and stability of fingerprinting by the dynamic selection of signal-domain distance to obtain reliable nearest reference points (RPs). Two stages were included in this algorithm. One was the offline stage, where the offline fingerprint database was constructed and the other was the online positioning stage. Three distances (Euclidean distance, Manhattan distance, and cosine distance), DBSCAN, and high-resolution distance selection principle were combined to obtain more reliable nearest RPs and optimal signal-domain distance in the online stage. Fused distance, the fusion of position-domain and signal-domain distances, was applied for DBSCAN to generate the clustering results, considering both the spatial structure and signal strength of RPs. Based on the principle that the higher resolution the distance, the more clusters will be obtained, the high-resolution distance was used to compute positioning results. The weighted K-nearest neighbor (WKNN) considering signal-domain distance selection was used to estimate positions. Two scenarios were selected as test areas; a complex-layout room (Scenario A) for post-graduates and a typical large indoor environment (Scenario B) covering 3200 m2. In both Scenarios A and B, compared with support vector machine (SVM), Gaussian process regression (GPR) and rank algorithms, the improvement rates of positioning accuracy and stability of the proposed algorithm were up to 60.44 and 60.93%, respectively. Experimental results show that the proposed algorithm has a better positioning performance in complex and large indoor environments.

DBSCAN (density-based spatial clustering of applications with noise) is one of the most widely used density-based clustering algorithms, which can find arbitrary shapes of clusters, determine the number of clusters, and identify noise samples automatically. However, the performance of DBSCAN is significantly limited as it is quite sensitive to the parameters of eps and MinPts. Eps represents the eps-neighborhood and MinPts stands for a minimum number of points. Additionally, a dataset with large variations in densities will probably trap the DBSCAN because its parameters are fixed. In order to overcome these limitations, we propose a new density-clustering algorithm called GNN-DBSCAN which uses an adaptive Grid to divide the dataset and defines local core samples by using the Nearest Neighbor. With the help of grid, the dataset space will be divided into a finite number of cells. After that, the nearest neighbor lying in every filled cell and adjacent filled cells are defined as the local core samples. Then, GNN-DBSCAN obtains global core samples by enhancing and screening local core samples. In this way, our algorithm can identify higher-quality core samples than DBSCAN. Lastly, give these global core samples and use dynamic radius based on k-nearest neighbors to cluster the datasets. Dynamic radius can overcome the problems of DBSCAN caused by its fixed parameter eps. Therefore, our method can perform better on dataset with large variations in densities. Experiments on synthetic and real-world datasets were conducted. The results indicate that the average Adjusted Rand Index (ARI), Normalized Mutual Information (NMI), Adjusted Mutual Information (AMI) and V-measure of our proposed algorithm outperform the existing algorithm DBSCAN, DPC, ADBSCAN, and HDBSCAN.

Anomaly detection concerns identifying anomalous observations or patterns that are a deviation from the dataset's expected behaviour. The detection of anomalies has significant and practical applications in several industrial domains such as public health, finance, Information Technology (IT), security, medical, energy, and climate studies. Density-Based Spatial Clustering of Applications with Noise (DBSCAN) Algorithm is a density-based clustering algorithm with the capability of identifying anomalous data. In this paper, a modified DBSCAN algorithm is proposed for anomaly detection in time-series data with seasonality. For experimental evaluation, a monthly temperature dataset was employed and the analysis set forth the advantages of the modified DBSCAN over the standard DBSCAN algorithm for the seasonal datasets. From the result analysis, we may conclude that DBSCAN is used for finding the anomalies in a dataset but fails to find local anomalies in seasonal data. The proposed Modified DBSCAN approach helps to find both the global and local anomalies from the seasonal data. Using normal DBSCAN we are able to get 19 (2.16%) anomaly points. While using the modified approach for DBSCAN we are able to get 42 (4.79%) anomaly points. In comparison we can say that we are able to get 2.11% more anomalies using the modified DBSCAN approach. Hence, the proposed Modified DBSCAN algorithm outperforms in comparison with the DBSCAN algorithm to find local anomalies.

Clustering is a task that aims to grouping data objects into several groups. DBSCAN is a density-based clustering method. However, it requires two parameters and these two parameters are hard to decide. Also, DBSCAN has difficulties in finding clusters when the density changes in the dataset. In this paper, we modify the original DBSCAN to make it able to determine the appropriate eps values according to data distribution and to cluster when the density varies among dataset. The main idea is to run DBSCAN with different eps and Minpts values. We also modified the calculation of the Minpts so that DBSCAN can have better clustering results. We did several experiments to evaluate the performance. The results suggest that our proposed DBSCAN can automatically decide the appropriate eps and Minpts values and can detect clusters with different density-levels.

The density based clustering method Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a popular method for outlier recognition and has received tremendous attention from many different areas. A major issue of the original DBSCAN is that the time complexity could be as large as quadratic. Most of existing DBSCAN algorithms focus on developing efficient index structures to speed up the procedure in low-dimensional Euclidean space. However, the research of DBSCAN in high-dimensional Euclidean space or general metric spaces is still quite limited, to the best of our knowledge. In this paper, we consider the metric DBSCAN problem under the assumption that the inliers (excluding the outliers) have a low doubling dimension. We apply a novel randomized k-center clustering idea to reduce the complexity of range query, which is the most time consuming step in the whole DBSCAN procedure. Our proposed algorithms do not need to build any complicated data structures and are easy to implement in practice. The experimental results show that our algorithms can significantly outperform the existing DBSCAN algorithms in terms of running time.

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.

Anomaly detection is critical across domains, from cybersecurity to fraud prevention. Graphs, adept at modeling intricate relationships, offer a flexible framework for capturing complex data structures. This paper proposes a novel anomaly detection approach, combining Graph Convolutional Networks (GCNs) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN). GCNs, a specialized deep learning model for graph data, extracts meaningful node and edge representations by incorporating graph topology and attribute information. This facilitates learning expressive node embeddings capturing local and global structural patterns. For anomaly detection, DBSCAN, a density-based clustering algorithm effective in identifying clusters of varying densities amidst noise, is employed. By defining a minimum distance threshold and a minimum number of points within that distance, DBSCAN proficiently distinguishes normal graph elements from anomalies. Our approach involves training a GCN model on a labeled graph dataset, generating appropriately labeled node embeddings. These embeddings serve as input to DBSCAN, identifying clusters and isolating anomalies as noise points. The evaluation on benchmark datasets highlights the superior performance of our approach in anomaly detection compared to traditional methods. The fusion of GCNs and DBSCAN demonstrates a significant potential for accurate and efficient anomaly detection in graphs. This research contributes to advancing graph-based anomaly detection, with promising applications in domains where safeguarding data integrity and security is paramount.