MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Concept decompositions for large sparse text data using clustering
Machine Learning
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
An updated set of basic linear algebra subprograms (BLAS)
ACM Transactions on Mathematical Software (TOMS)
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
Revised Papers from Large-Scale Parallel Data Mining, Workshop on Large-Scale Parallel KDD Systems, SIGKDD
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Multiclass Spectral Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Spectral Grouping Using the Nyström Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
RCV1: A New Benchmark Collection for Text Categorization Research
The Journal of Machine Learning Research
Segmentation of 3D Meshes through Spectral Clustering
PG '04 Proceedings of the Computer Graphics and Applications, 12th Pacific Conference
SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
A parallel hybrid web document clustering algorithm and its performance study
The Journal of Supercomputing - Special issue: Parallel and distributed processing and applications
A tutorial on spectral clustering
Statistics and Computing
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Spectral Clustering with Random Projection and Sampling
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
Processing web-scale multimedia data
Proceedings of the international conference on Multimedia
A comprehensive approach to image spam detection: from server to client solution
IEEE Transactions on Information Forensics and Security
Unsupervised action classification using space-time link analysis
Journal on Image and Video Processing
On a strategy for spectral clustering with parallel computation
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
Fast density-weighted low-rank approximation spectral clustering
Data Mining and Knowledge Discovery
Spectral analysis for billion-scale graphs: discoveries and implementation
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II
Fast affinity propagation clustering: A multilevel approach
Pattern Recognition
Locally-scaled spectral clustering using empty region graphs
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-level Low-rank Approximation-based Spectral Clustering for image segmentation
Pattern Recognition Letters
Interpreting pedestrian behaviour by visualising and clustering movement data
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
Automatic image segmentation using constraint learning and propagation
Digital Signal Processing
Hi-index | 0.00 |
Spectral clustering algorithm has been shown to be more effective in finding clusters than most traditional algorithms. However, spectral clustering suffers from a scalability problem in both memory use and computational time when a dataset size is large. To perform clustering on large datasets, we propose to parallelize both memory use and computation on distributed computers. Through an empirical study on a large document dataset of 193,844 data instances and a large photo dataset of 637,137, we demonstrate that our parallel algorithm can effectively alleviate the scalability problem.