Sparse Clustering Algorithm Based on Multi-Domain Dimensionality Reduction Autoencoder
The key to high-dimensional clustering lies in discovering the intrinsic structures and patterns in data to provide valuable information. However, high-dimensional clustering faces enormous challenges such as dimensionality disaster, increased data sparsity, and reduced reliability of the clustering...
Saved in:
Published in | Mathematics (Basel) Vol. 12; no. 10; p. 1526 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
Basel
MDPI AG
01.05.2024
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!