Spectral Clustering Algorithm: MATLAB PCT-Based Parallel Design and Implementation

Yu Yang; Cheng Gui Zhao

doi:10.4028/www.scientific.net/AMR.765-767.580

Paper Titles

Image Quality Assessment Method for Underwater Acoustic Communication Based on Digital Watermarking
p.562

An Error-Reduced ADI-FDTD Algorithm in Debye Media
p.567

Research of Adaptive Gradient Projection Algorithm on Remote Sensing Image Reconstruction
p.572

Research on the Interactive Technology of Reservoir 3D Display
p.576

Spectral Clustering Algorithm: MATLAB PCT-Based Parallel Design and Implementation
p.580

Volume Rendering of 3D Borehole Data Based on GPU
p.585

Visual Modeling Application in the Aircraft Emergency Evacuation Simulation Based on Virtools
p.591

Some Properties and a Characterization of Two-Directional Scaling Function
p.595

A Method for Ranking Battlefield Damaged Equipment Repairs Based on TOPSIS
p.600

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 765-767Spectral Clustering Algorithm: MATLAB PCT-Based...

Spectral Clustering Algorithm: MATLAB PCT-Based Parallel Design and Implementation

Abstract:

Spectral clustering algorithms inevitable exist computational time and memory use problems for large-scale spectral clustering, owing to compute-intensive and data-intensive. We analyse the time complexity of constructing similarity matrix, doing eigendecomposition and performing k-means and exploiting SPMD parallel structure supported by MATLAB Parallel Computing Toolbox (PCT) to decrease eigendecomposition computational time. We propose using MATLAB Distributed Computing Server to parallel construct similarity matrix, whilst using t-nearest neighbors approach to reduce memory use. Ultimately, we present clustering time, clustering quality and clustering accuracy in the experiments.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

580-584

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.765-767.580

Citation:

Cite this paper

Online since:

September 2013

Authors:

Yu Yang, Cheng Gui Zhao

Keywords:

MATLAB PCT, Parallel Spectral Clustering Computing, SPMD, t-Nearest-Neighbors

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Ng, A., Jordan, M., Weiss, Y., On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems, vol. 14, MIT Press , (2001).

Google Scholar

[2] G.L. Scott and H. C. Longuet-Higgins, Feature Grouping by Relocalisation of Eigenvectors of the Proxmity Matrix, In Proc. British Machine Vision Conference, pp.103-108, (1990).

DOI: 10.5244/c.4.20

Google Scholar

[3] P. Perona and W. T. Freeman , A factorization approach to grouping, In H. Burkardt and B. Neumann, editors, Proc ECCV, pp.655-670, (1998).

Google Scholar

[4] J. Shi and J. Malik, Normalized Cuts and Image Segmentation, In Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp.731-737, (1997).

DOI: 10.1109/cvpr.1997.609407

Google Scholar

[5] Wen-Yen Chen, Yangqiu Song, Hongjie Bai, Chih-Jen Lin, Chang, E.Y., Parallel Spectral Clustering in Distributed Systems, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, pp.568-586, (2011).

DOI: 10.1109/tpami.2010.88

Google Scholar

[6] Ulrike Von Luxburg, A tutorial on spectral clustering, Statistics and computing, Springer, pp.395-416, 22 August (2007).

DOI: 10.1007/s11222-007-9033-z

Google Scholar

[7] http: /www. mathworks. cn/cn/help/distcomp/spmd. html.

Google Scholar