Kernel Density Based Spatial Clustering of Applications with Noise

Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a widely used clustering algorithm renowned for its ability to identify clusters of arbitrary shapes and detect noise. However, its reliance on fixed parameters, such as the minimum number of points (MinPts) and the epsilon radi...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the International Florida Artificial Intelligence Research Society Conference Vol. 38; no. 1
Main Authors: Kalpavruksha, Rohan, Kalpavruksha, Roshan, Cha, Teryn, Cha, Sung-Hyuk
Format: Journal Article
Language:English
Published: LibraryPress@UF 14.05.2025
Subjects:
Clustering
DBSCAN
Kernel
ISSN:2334-0754, 2334-0762
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a widely used clustering algorithm renowned for its ability to identify clusters of arbitrary shapes and detect noise. However, its reliance on fixed parameters, such as the minimum number of points (MinPts) and the epsilon radius (epsilon), makes it sensitive to variations in sample density. This paper reinterprets DBSCAN as a specific case of kernel density estimation (KDE)-based clustering, where the kernel shape corresponds to a hyper-rectangular pillar or cylindrical kernel, depending on the distance metric. Building on this foundation, we introduce a flexible framework incorporating various kernel functions, including uniform, conical, Epanechnikov, cosine, exponential, and Gaussian kernels, to estimate the density distribution of data points. The threshold values are selected to identify high-density regions by retaining the top 90% of points, while excluding low-density points as noise, thereby enhancing clustering precision. Clusters are adaptively formed by leveraging points within the kernel range, thereby increasing the algorithm's robustness to noise and its adaptability to irregular density patterns. Empirical results demonstrate that the proposed approach outperforms traditional DBSCAN, as evidenced by lower Davies-Bouldin indices and higher silhouette scores. This study highlights the potential of density-driven clustering for practical applications, including social media sentiment analysis, customer segmentation in e-commerce, and medical data analysis, particularly in scenarios involving noise-prone or unevenly distributed datasets.
AbstractList Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a widely used clustering algorithm renowned for its ability to identify clusters of arbitrary shapes and detect noise. However, its reliance on fixed parameters, such as the minimum number of points (MinPts) and the epsilon radius (epsilon), makes it sensitive to variations in sample density. This paper reinterprets DBSCAN as a specific case of kernel density estimation (KDE)-based clustering, where the kernel shape corresponds to a hyper-rectangular pillar or cylindrical kernel, depending on the distance metric. Building on this foundation, we introduce a flexible framework incorporating various kernel functions, including uniform, conical, Epanechnikov, cosine, exponential, and Gaussian kernels, to estimate the density distribution of data points. The threshold values are selected to identify high-density regions by retaining the top 90% of points, while excluding low-density points as noise, thereby enhancing clustering precision. Clusters are adaptively formed by leveraging points within the kernel range, thereby increasing the algorithm's robustness to noise and its adaptability to irregular density patterns. Empirical results demonstrate that the proposed approach outperforms traditional DBSCAN, as evidenced by lower Davies-Bouldin indices and higher silhouette scores. This study highlights the potential of density-driven clustering for practical applications, including social media sentiment analysis, customer segmentation in e-commerce, and medical data analysis, particularly in scenarios involving noise-prone or unevenly distributed datasets.
Author Cha, Sung-Hyuk
Kalpavruksha, Roshan
Cha, Teryn
Kalpavruksha, Rohan
Author_xml – sequence: 1
  givenname: Rohan
  surname: Kalpavruksha
  fullname: Kalpavruksha, Rohan
– sequence: 2
  givenname: Roshan
  surname: Kalpavruksha
  fullname: Kalpavruksha, Roshan
– sequence: 3
  givenname: Teryn
  surname: Cha
  fullname: Cha, Teryn
– sequence: 4
  givenname: Sung-Hyuk
  surname: Cha
  fullname: Cha, Sung-Hyuk
BookMark eNo9kMtKAzEYhYNUsNY-gZu8wIy5TpJlW69YdKGuQ25TI-NkSEakb2_pSFf_4T_wHfguwaxPfQDgGqOaEiboTduZmEtNZY1rTKVS8gzMCaWsQqIhs1Pm7AIsS4kWMSZ4ozifg_VzyH3o4G3oSxz3cG1K8PBtMGM0Hdx0P2UMOfY7mFq4GoYuukOT-gJ_4_gJX1Is4Qqct6YrYfl_F-Dj_u5981htXx-eNqtt5QgRspJSEctxoxoTmCWeWeeksCog4V1LjPDMUeF94zknLSbBe0U4YcYSayUldAGeJq5P5ksPOX6bvNfJRH18pLzTJo_RdUEzi1BrkbO4CUyYYLy1VOHDsgycS35g0Ynlciolh_bEw0gfrerJqqZSYz1ZpX8ELm6_
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.32473/flairs.38.1.138998
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2334-0762
ExternalDocumentID oai_doaj_org_article_4b00fb0cb16e47aeadbb3916ae8e5585
10_32473_flairs_38_1_138998
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c2278-8892b51696ae4b2d4bcc87b9e07dcf2a7d4c37dd6d552f12edd92524ab2bb8323
IEDL.DBID DOA
ISSN 2334-0754
IngestDate Fri Oct 03 12:44:14 EDT 2025
Sat Nov 29 07:52:14 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://creativecommons.org/licenses/by-nc/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2278-8892b51696ae4b2d4bcc87b9e07dcf2a7d4c37dd6d552f12edd92524ab2bb8323
OpenAccessLink https://doaj.org/article/4b00fb0cb16e47aeadbb3916ae8e5585
ParticipantIDs doaj_primary_oai_doaj_org_article_4b00fb0cb16e47aeadbb3916ae8e5585
crossref_primary_10_32473_flairs_38_1_138998
PublicationCentury 2000
PublicationDate 2025-05-14
PublicationDateYYYYMMDD 2025-05-14
PublicationDate_xml – month: 05
  year: 2025
  text: 2025-05-14
  day: 14
PublicationDecade 2020
PublicationTitle Proceedings of the International Florida Artificial Intelligence Research Society Conference
PublicationYear 2025
Publisher LibraryPress@UF
Publisher_xml – name: LibraryPress@UF
SSID ssib044756955
ssib059229545
Score 2.2915626
Snippet Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a widely used clustering algorithm renowned for its ability to identify clusters of...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms Clustering
DBSCAN
Kernel
Title Kernel Density Based Spatial Clustering of Applications with Noise
URI https://doaj.org/article/4b00fb0cb16e47aeadbb3916ae8e5585
Volume 38
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2334-0762
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib059229545
  issn: 2334-0754
  databaseCode: DOA
  dateStart: 20210101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2334-0762
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044756955
  issn: 2334-0754
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8NAEF6kePAiior1xR48mjbZR3b32NYWQSweFHoL2RcUSiq1Fbz4251JqsaTFy85hLDszszOzGZ2vo-Qa4ipeRmYTXyQaSKCAD_oZZnknHOnYGuW0ddkE2o61bOZeWxRfeGdsAYeuBFcX4BdRJs6m-UwUAkLtxabRcugg4RcF71vqkzrMAWWhCh2ufnpuJQGWatrxmLGuUggTooGggjyCcX7cYHFkx7XvayHlTujf4WpFpp_HXYmB2R_my_SQTPPQ7ITqiMyvA-rKizoLd4-X7_TIYQiT5FdGKyJjhYbRD-AmESXkQ5aFWqKf13pdDl_DcfkeTJ-Gt0lWzKExGG3aqK1YRaLWrByYZkX1jmtrAmp8i6yUnnhuEJ-KClZzFjw3jDJRGmZtbBt-QnpVMsqnBIaRe6DkDaKGLET3vjARQzgaSA75E50yc3X2ouXBvOigLNCLaqiEVXBdZEVjai6ZIjy-f4UAavrF6DGYqvG4i81nv3HIOdkjyE9L4KrigvSWa824ZLsurf1_HV1VVsIPB8-xp_v77_p
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Kernel+Density+Based+Spatial+Clustering+of+Applications+with+Noise&rft.jtitle=The+International+FLAIRS+Conference+Proceedings&rft.au=Kalpavruksha%2C+Rohan&rft.au=Kalpavruksha%2C+Roshan&rft.au=Cha%2C+Teryn&rft.au=Cha%2C+Sung-Hyuk&rft.date=2025-05-14&rft.issn=2334-0754&rft.eissn=2334-0762&rft.volume=38&rft_id=info:doi/10.32473%2Fflairs.38.1.138998&rft.externalDBID=n%2Fa&rft.externalDocID=10_32473_flairs_38_1_138998
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2334-0754&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2334-0754&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2334-0754&client=summon