Comprehensive survey on hierarchical clustering algorithms and the recent developments
X Ran, Y **, Y Lu, X Wang, Z Lu - Artificial Intelligence Review, 2023 - Springer
Data clustering is a commonly used data processing technique in many fields, which divides
objects into different clusters in terms of some similarity measure between data points …
objects into different clusters in terms of some similarity measure between data points …
Deep learning on computational‐resource‐limited platforms: A survey
C Chen, P Zhang, H Zhang, J Dai, Y Yi… - Mobile Information …, 2020 - Wiley Online Library
Nowadays, Internet of Things (IoT) gives rise to a huge amount of data. IoT nodes equipped
with smart sensors can immediately extract meaningful knowledge from the data through …
with smart sensors can immediately extract meaningful knowledge from the data through …
Ultra-scalable spectral clustering and ensemble clustering
This paper focuses on scalability and robustness of spectral clustering for extremely large-
scale datasets with limited resources. Two novel algorithms are proposed, namely, ultra …
scale datasets with limited resources. Two novel algorithms are proposed, namely, ultra …
Local feature descriptor for image matching: A survey
Image registration is an important technique in many computer vision applications such as
image fusion, image retrieval, object tracking, face recognition, change detection and so on …
image fusion, image retrieval, object tracking, face recognition, change detection and so on …
An efficient spectral clustering algorithm based on granular-ball
In order to solve the problem that the traditional spectral clustering algorithm is time-
consuming and resource consuming when applied to large-scale data, resulting in poor …
consuming and resource consuming when applied to large-scale data, resulting in poor …
Weighted bilateral K-means algorithm for fast co-clustering and fast spectral clustering
Bipartite spectral graph partition (BSGP) is a school of the most well-known algorithms
designed for the bipartite graph partition problem. It is also a fundamental mathematical …
designed for the bipartite graph partition problem. It is also a fundamental mathematical …
Self-constrained spectral clustering
L Bai, J Liang, Y Zhao - IEEE Transactions on Pattern Analysis …, 2022 - ieeexplore.ieee.org
As a leading graph clustering technique, spectral clustering is one of the most widely used
clustering methods to capture complex clusters in data. Some additional prior information …
clustering methods to capture complex clusters in data. Some additional prior information …
Fast fuzzy clustering based on anchor graph
Fuzzy clustering is one of the most popular clustering approaches and has attracted
considerable attention in many fields. However, high computational cost has become a …
considerable attention in many fields. However, high computational cost has become a …
Fast spectral clustering with self-adapted bipartite graph learning
Spectral Clustering (SC) is a widespread used clustering algorithm in data mining, image
processing, etc. It is a graph-based algorithm capable of handling arbitrarily distributed data …
processing, etc. It is a graph-based algorithm capable of handling arbitrarily distributed data …
Graph regularized Lp smooth non-negative matrix factorization for data representation
This paper proposes a Graph regularized Lp smooth non-negative matrix factorization
(GSNMF) method by incorporating graph regularization and Lp smoothing constraint, which …
(GSNMF) method by incorporating graph regularization and Lp smoothing constraint, which …