<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Enhancing DBSCAN Accuracy and Computational Efficiency Using Closest Access Point Pre-Clustering for Fingerprint-Based Localization

dc.contributor.authorYaro, Abdulmalik Shehu
dc.contributor.authorMalý, Filip
dc.contributor.authorPražák, Pavel
dc.date.accessioned2025-12-05T15:42:15Z
dc.date.available2025-12-05T15:42:15Z
dc.date.issued2025
dc.description.abstractWithin the context of fingerprint database clustering, the density-based spatial clustering of applications with noise (DBSCAN) is notable for its robustness to outliers and ability to handle clusters of different sizes and shapes. However, its high computational burden limits its scalability for dense fingerprint databases. A hybrid two-stage clustering method, the CAP-DBSCAN algorithm, is proposed in this paper, designed to accelerate DBSCAN clustering while ensuring accuracy for fingerprint-based localisation systems. The CAP-DBSCAN algorithm employs the closest access point (CAP) algorithm to pre-cluster the database, while the DBSCAN algorithm performs clustering refinement. It dynamically adjusts the neighborhood radius (Eps) value for each pre-cluster using the k-distance plot method. The performance of the CAP-DBSCAN algorithm is determined across four publicly available received signal strength (RSS)-based fingerprint databases with Euclidean and Manhattan distances as fingerprint similarity metrics. This is benchmarked against the performances of the standard DBSCAN (s-DBSCAN) and k-means++-DBSCAN (k-DBSCAN) algorithms presented in previous research. Simulation results show that the CAP-DBSCAN algorithm consistently outperforms both the s-DBSCAN and k-DBSCAN algorithms, achieving higher silhouette scores, which indicates the generation of more compact and well-defined clusters. Furthermore, the CAP-DBSCAN algorithm demonstrates superior computational efficiency as a result of the CAP algorithm generating well-structured pre-clusters better than those generated by the k-means++ algorithm. This significantly reduces the computational burden of the cluster refinement process. Overall, using Manhattan distance as a fingerprint similarity metric results in the best clustering performance of the CAP-DBSCAN algorithm. These findings underscore the potential of the CAP-DBSCAN algorithm for practical applications in resource-constrained fingerprint-based localization systems. © 2025, Ital Publication. All rights reserved.eng
dc.formatp. 352-362
dc.identifier.doi10.28991/HIJ-2025-06-01-022
dc.identifier.issn2723-9535
dc.identifier.obd43882022
dc.identifier.urihttp://hdl.handle.net/20.500.12603/2391
dc.language.isoeng
dc.peerreviewedyes
dc.publicationstatuspostprint
dc.publisherItal Publication
dc.relation.ispartofHighTech and Innovation Journal, volume 6, issue: 1eng
dc.relation.publisherversionhttps://hightechjournal.org/index.php/HIJ/article/view/1183
dc.rights.accessOpen Access
dc.rights.licenseCC BY
dc.source.urlhttps://hightechjournal.org/index.php/HIJ/article/view/1183
dc.subjectComputational Efficiencyeng
dc.subjectDBSCANeng
dc.subjectFingerprint-Based Localizationeng
dc.subjectPre-clustering Approacheng
dc.subjectProximity-Based Clusteringeng
dc.titleEnhancing DBSCAN Accuracy and Computational Efficiency Using Closest Access Point Pre-Clustering for Fingerprint-Based Localizationeng
dc.typearticle

Soubory

Původní svazek

Nyní se zobrazuje 1 - 1 z 1
Načítá se...
Náhled
Název:
Enhancing_DBSCAN_Accuracy_and_Computational_Efficiency_Using_Closest_Access_Point_Pre-Clustering_for_Fingerprint-Based_Localizat.pdf
Velikost:
1,03 MB
Formát:
Adobe Portable Document Format