A fast O (NlgN) time hybrid clustering algorithm using the circumference proximity based merging technique for diversified datasets

MM Akhter, SK Mohanty - Engineering Applications of Artificial Intelligence, 2023 - Elsevier
Clustering has been widely employed for extracting intrinsic groups because of its low
reliance on domain knowledge. Though several clustering techniques have been developed …

A systemic efficiency measurement of resource management and sustainable practices: A network bias-corrected DEA assessment of OECD countries

Y Liu, I Alnafrah, Y Zhou - Resources Policy, 2024 - Elsevier
In the face of pressing challenges such as climate change and dwindling biodiversity, the
global need for optimizing natural resource management is urgent. To address this, green …

A fast spectral clustering technique using MST based proximity graph for diversified datasets

AA Khan, SK Mohanty - Information Sciences, 2022 - Elsevier
Spectral clustering is a popular unsupervised learning technique used for exploratory
analysis of complex datasets. In spectral clustering, the efficient construction of a sparse …

A novel ship trajectory clustering method for Finding Overall and Local Features of Ship Trajectories

C Tang, M Chen, J Zhao, T Liu, K Liu, H Yan, Y **ao - Ocean engineering, 2021 - Elsevier
Ship trajectory clustering is one of the main methods of ship trajectory mining based on AIS
data. However, there exist two main problems in trajectory clustering: One is the inherent …

A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint

Y Ma, H Lin, Y Wang, H Huang, X He - Information Sciences, 2021 - Elsevier
The minimum spanning tree clustering algorithm is known to be capable of detecting
clusters with irregular boundaries. The paper presents a novel hierarchical clustering …

NS-IDBSCAN: An efficient incremental clustering method for geospatial data in network space

TTD Nguyen, LTT Nguyen, QT Bui, B Vo - Information Sciences, 2025 - Elsevier
The exponential growth of big data presents a significant task for the incremental clustering
problem. This paper proposes a density-based total clustering method in network space (NS …

Clustering with minimum spanning trees: How good can it be?

M Gagolewski, A Cena, M Bartoszuk… - Journal of Classification, 2024 - Springer
Minimum spanning trees (MSTs) provide a convenient representation of datasets in
numerous pattern recognition activities. Moreover, they are relatively fast to compute. In this …

Minimum spanning tree‐based cluster analysis: A new algorithm for determining inconsistent edges

F Şaar, AE Topcu - Concurrency and Computation: Practice …, 2022 - Wiley Online Library
In recent years, graph‐based data clustering algorithms have become popular as they
perform connectivity‐based rather than centroid‐based partitioning. Methods related to …

Comparative Analysis of Optimization Strategies for K-means Clustering in Big Data Contexts: A Review

R Mussabayev, R Mussabayev - arxiv preprint arxiv:2310.09819, 2023 - arxiv.org
This paper presents a comparative analysis of different optimization techniques for the K-
means algorithm in the context of big data. K-means is a widely used clustering algorithm …

An improved OPTICS clustering algorithm for discovering clusters with uneven densities

C Tang, H Wang, Z Wang, X Zeng… - Intelligent Data …, 2021 - journals.sagepub.com
Most density-based clustering algorithms have the problems of difficult parameter setting,
high time complexity, poor noise recognition, and weak clustering for datasets with uneven …