Parallel Spectral Clustering Algorithm Based on Hadoop
Yajun Cui, Yang Zhao, Kafei Xiao, Chenglong Zhang, Lei Wang

TL;DR
This paper presents a parallel spectral clustering algorithm implemented on Hadoop, leveraging cloud computing to improve clustering efficiency and accuracy, with experimental validation demonstrating its effectiveness.
Contribution
It introduces a novel parallel spectral clustering method based on Hadoop, addressing scalability and performance issues of traditional spectral clustering algorithms.
Findings
The algorithm achieves improved scalability on large datasets.
Experimental results show enhanced clustering accuracy.
The method demonstrates efficient parallel processing capabilities.
Abstract
Spectral clustering and cloud computing is emerging branch of computer science or related discipline. It overcome the shortcomings of some traditional clustering algorithm and guarantee the convergence to the optimal solution, thus have to the widespread attention. This article first introduced the parallel spectral clustering algorithm research background and significance, and then to Hadoop the cloud computing Framework has carried on the detailed introduction, then has carried on the related to spectral clustering is introduced, then introduces the spectral clustering arithmetic Method of parallel and relevant steps, finally made the related experiments, and the experiment are summarized.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computing and Algorithms · Anomaly Detection Techniques and Applications · Graph Theory and Algorithms
MethodsSpectral Clustering
