The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014) 2014
DOI: 10.1109/icadiwt.2014.6814687
|View full text |Cite
|
Sign up to set email alerts
|

DBSCAN: Past, present and future

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
70
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
2
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 283 publications
(105 citation statements)
references
References 17 publications
0
70
0
Order By: Relevance
“…On the basis of these definitions, the goal of DBSCAN is to find some points which satisfy the minimum density requirement of MinPts points within the eps distance to be mareked as cores. Then, expand the cores using transitive similarity to include border points, as illustrated in Algorithm 1 (Rehman et al 2014). In our work, constructing the value space of an attribute (see Algorithm 1: Pseudo-code of the DBSCAN as discussed in Rehman et al (2014) Input : @dataset, @eps, @minPts Output: Clusteres of Dataset 1 Function DBSCAN(dataset, eps, minPts ) continue "Constructing the value space of an attribute" subsection) is modeled as an application of DBSCAN.…”
Section: Dbscan Clustering Algorithmmentioning
confidence: 99%
“…On the basis of these definitions, the goal of DBSCAN is to find some points which satisfy the minimum density requirement of MinPts points within the eps distance to be mareked as cores. Then, expand the cores using transitive similarity to include border points, as illustrated in Algorithm 1 (Rehman et al 2014). In our work, constructing the value space of an attribute (see Algorithm 1: Pseudo-code of the DBSCAN as discussed in Rehman et al (2014) Input : @dataset, @eps, @minPts Output: Clusteres of Dataset 1 Function DBSCAN(dataset, eps, minPts ) continue "Constructing the value space of an attribute" subsection) is modeled as an application of DBSCAN.…”
Section: Dbscan Clustering Algorithmmentioning
confidence: 99%
“…epsilon and minimum number of points. Parameter epsilon is defined as the radius of neighborhood around a certain point x, and parameter minimum number of points as the minimum quantity of neighbors in the limit of the radius [49]. Minimum number of points was set to 5, and optimal epsilon value was determined based on kNN plot which is equal 2.0 ( Fig.…”
Section: Molecular Docking Of Hsa Withmentioning
confidence: 99%
“…After studying various clustering techniques [5,7,19,33], we chose Formal Concept Analysis (FCA) [16,42] as the backbone for the event detection process of our approach. FCA is incremental and multi-modal (criteria 8 and 6).…”
Section: Fca Preliminaries and Definitionsmentioning
confidence: 99%
“…Objects in the low density zones are considered noise while others in high density regions belong to the group limited by the region. For example, DB-Scan [33] produces a partitional clustering based on density measures. This method studies the neighborhood of each point, and partitions data into dense regions separated by not-so-dense regions.…”
Section: Clustering Techniquesmentioning
confidence: 99%