2020
DOI: 10.1016/j.matpr.2020.01.110
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of clustering algorithms for varying cardinality and dimensionality of data sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2
2

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(13 citation statements)
references
References 26 publications
0
11
0
Order By: Relevance
“…We used the density-based spatial clustering of applications with noise (DBSCAN) algorithm to group high-density closely related data points (or geo-locations), forming spatial clusters of data points that represented significant events (such as stopping and movement ) during normal minibus taxi operations. We chose the DBSCAN algorithm because of its robustness to outlier detection, its ability to discover clusters with uneven densities and arbitrary shapes, and the fact that it does not need prior knowledge of the number of clusters (Liu et al, 2012;Renjith et al, 2020). For cluster analysis we used a Python implementation of the DBSCAN algorithm from the Scikit-Learn package (Pedregosa et al, 2011).…”
Section: Spatial Clustering and Analysismentioning
confidence: 99%
“…We used the density-based spatial clustering of applications with noise (DBSCAN) algorithm to group high-density closely related data points (or geo-locations), forming spatial clusters of data points that represented significant events (such as stopping and movement ) during normal minibus taxi operations. We chose the DBSCAN algorithm because of its robustness to outlier detection, its ability to discover clusters with uneven densities and arbitrary shapes, and the fact that it does not need prior knowledge of the number of clusters (Liu et al, 2012;Renjith et al, 2020). For cluster analysis we used a Python implementation of the DBSCAN algorithm from the Scikit-Learn package (Pedregosa et al, 2011).…”
Section: Spatial Clustering and Analysismentioning
confidence: 99%
“…The immense generation of data has spurred a rapid development in the utilisation of several data science techniques to obtain relevant socio-economic value from the data being produced in fields such as medicine, biology, transportation and business enterprises [18]. It is obvious that the interdisciplinary sub-field of data mining, which involves the design and implementation of a scalable descriptive and predictive machine learning algorithms, has made commendable efforts to discover useful patterns in datasets that will prove very useful [14,16,18].…”
Section: Related Workmentioning
confidence: 99%
“…Furthermore, there is a surge in the cardinality of the datasets with increasing deposits of observations due to frequently used services such as trading platforms, social networking and app data usage. Due to this growing challenge of data complexity, many pre-processing techniques have been proposed to reduce the dimensions and cardinality of the data entries [18]. This helps to reduce the computational costs involved in the clustering operations and detection of outliers.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…We used the DBSCAN (density-based spatial clustering of applications with noise) algorithm to group high-density closely related data points (or geo-locations), forming spatial clusters of data points that represented significant events (such as stopping and movement) during normal minibus taxi operations. We chose this algorithm because it is robust to outlier detection, can discover clusters with uneven densities and arbitrary shapes, and does not need prior knowledge of the number of clusters [53,54]. For cluster analysis in this chapter, we used a Python implementation of the DBSCAN algorithm from the Scikit-Learn package [55].…”
Section: Spatial Clustering and Analysismentioning
confidence: 99%