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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Joint Optimization Method of Dimensionality Reduction and Clustering for Big Data

Jikui Wang, Qiang Xiao, Feifei Liu
Advanced Clustering Algorithms Research
article

Joint Optimization Method of Dimensionality Reduction and Clustering for Big Data

Jikui Wang, Qiang Xiao, Feifei Liu
article en

Abstract

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.

Lanzhou University of Finance and Economics (CN)
Openalex Percentile: Top 73%
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.