Joint Optimization Method of Dimensionality Reduction and Clustering for Big Data
In recent years, the volume of data has increased rapidly, which has created unfavorable conditions for traditional data processing and analysis techniques. Clustering, as an important technique in data mining, plays an important role in handling big data. This paper reviews the joint optimization methods of dimensionality reduction and clustering for big data. Firstly, The clustering method is introduced. And then introduces three joint optimization methods: clustering and projected clustering with adaptive neighbors, projected fuzzy c-means with robabilistic neighbors, fuzzy k-means clustering with discriminative embedding, analyzes in detail the characteristics, strengths and weaknesses of each class of algorithms, and their experimental conditions are summarized. Ultimately, future research directions for joint clustering algorithms are envisioned.
Authors
- Jikui Wang (ORCID: https://orcid.org/0000-0001-5926-7007)
- Qiang Xiao
- Feifei Liu
Institutions
- Lanzhou University of Finance and Economics (CN)
Publication Details
- Published
- 2024-11-22
- DOI
- https://doi.org/10.1145/3722237.3722328
- Primary Topic
- Advanced Clustering Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00