A review of clustering techniques and developments

A Saxena, M Prasad, A Gupta, N Bharill, OP Patel… - Neurocomputing, 2017 - Elsevier
This paper presents a comprehensive study on clustering: exiting methods and
developments made at various times. Clustering is defined as an unsupervised learning …

Review of clustering technology and its application in coordinating vehicle subsystems

C Zhang, W Huang, T Niu, Z Liu, G Li, D Cao - Automotive Innovation, 2023 - Springer
Clustering is an unsupervised learning technology, and it groups information (observations
or datasets) according to similarity measures. Developing clustering algorithms is a hot topic …

A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method

KM Kumar, ARM Reddy - Pattern Recognition, 2016 - Elsevier
Density based clustering methods are proposed for clustering spatial databases with noise.
Density Based Spatial Clustering of Applications with Noise (DBSCAN) can discover …

A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data

Y Chen, S Tang, N Bouguila, C Wang, J Du, HL Li - Pattern Recognition, 2018 - Elsevier
Clustering is an important technique to deal with large scale data which are explosively
created in internet. Most data are high-dimensional with a lot of noise, which brings great …

Ecosystem health assessment: A comprehensive and detailed analysis of the case study in coastal metropolitan region, eastern China

R Xiao, Y Liu, X Fei, W Yu, Z Zhang, Q Meng - Ecological indicators, 2019 - Elsevier
The ecosystem health of coastal metropolitan regions is changing, which will exert a
negative impact on human survival and development in the future. In this case, it is a novel …

Clustering with local density peaks-based minimum spanning tree

D Cheng, Q Zhu, J Huang, Q Wu… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Clustering analysis has been widely used in statistics, machine learning, pattern recognition,
image processing, and so on. It is a great challenge for most existing clustering algorithms to …

Optimizing graph algorithms on pregel-like systems

S Salihoglu, J Widom - 2014 - ilpubs.stanford.edu
We study the problem of implementing graph algorithms efficiently on Pregel-like systems,
which can be surprisingly challenging. Standard graph algorithms in this setting can incur …

A fast minimum spanning tree algorithm based on K-means

C Zhong, M Malinen, D Miao, P Fränti - Information Sciences, 2015 - Elsevier
Minimum spanning trees (MSTs) have long been used in data mining, pattern recognition
and machine learning. However, it is difficult to apply traditional MST algorithms to a large …

An adaptive spatial clustering algorithm based on Delaunay triangulation

M Deng, Q Liu, T Cheng, Y Shi - Computers, Environment and Urban …, 2011 - Elsevier
In this paper, an adaptive spatial clustering algorithm based on Delaunay triangulation
(ASCDT for short) is proposed. The ASCDT algorithm employs both statistical features of the …

A density-based spatial clustering algorithm considering both spatial proximity and attribute similarity

Q Liu, M Deng, Y Shi, J Wang - Computers & Geosciences, 2012 - Elsevier
Geometrical properties and attributes are two important characteristics of a spatial object. In
previous spatial clustering studies, these two characteristics were often neglected. This …