• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Parallel Spectral Clustering

Cached

  • Download as a PDF

Download Links

  • [infolab.stanford.edu]
  • [www.csie.ntu.edu.tw]
  • [alumni.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [www.nec-labs.com]
  • [math.wayne.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Yangqiu Song , Wen-yen Chen , Hongjie Bai , Chih-jen Lin , Edward Y. Chang
Citations:6 - 2 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Song_parallelspectral,
    author = {Yangqiu Song and Wen-yen Chen and Hongjie Bai and Chih-jen Lin and Edward Y. Chang},
    title = {Parallel Spectral Clustering},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. 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. Key words: Parallel spectral clustering, distributed computing 1

Citations

1824 Normalized cuts and image segmentation - Shi, Malik - 1997
756 On spectral clusterings: Analysis and an algorithm - Ng, Jordan, et al. - 2002
710 Spectral Graph Theory - Chung - 1997
405 2004 Finding and evaluating community structure in networks - Newman, Girvan
322 Arable P: Comparing partitions - Hubert - 1985
312 RCV1: A New Benchmark Collection for Text Categorization Research - Lewis, Yang, et al. - 2004
272 Cluster ensembles — a knowledge reuse framework for combining multiple partitions - Strehl, Ghosh
261 Segmentation using eigenvectors: A unifying view - Weiss
250 Schrodl S: Constrained k-means clustering with background knowledge - Wagstaff, Cardie, et al.
231 Concept decomposition for large sparse text data using clustering - Dhillon, Modha
218 Clustering data streams - Guha, Mishra, et al. - 2000
170 New spectral methods for ratio cut partitioning and clustering - Hagen, Kahng - 1992
156 A framework for clustering evolving data streams - Aggarwal, Han, et al. - 2003
152 The analysis of time-series: an introduction - Chatfield - 1980
138 A multilinear singular value decomposition - LATHAUWER, MOOR, et al.
129 R.: Incremental clustering and dynamic information retrieval - Charikar, Chekuri, et al. - 2004
120 Multiclass spectral clustering - Yu, Shi - 2003
117 Spectral grouping using the Nyström method - Fowlkes, Belongie, et al. - 2004
117 Y.: Document clustering based on non-negative matrix factorization - Xu, Liu, et al. - 2003
116 Spectral relaxation for k-means clustering - Zha, Ding, et al. - 2001
115 A min-max cut algorithm for graph partitioning and data clustering - Ding, He, et al. - 2001
111 Self-tuning spectral clustering - Zelnik-Manor, Perona - 2005
83 Map-reduce for machine learning on multicore - Chu, Kim, et al.
79 A Data-Clustering Algorithm on Distributed Memory Multiprocessors - Dhillon, Modha - 1999
77 Kernel k-means, spectral clustering and normalized cuts - Dhillon, Guan, et al. - 2004
75 Learning from labeled and unlabeled data on a directed graph - Zhou, Huang, et al. - 2005
73 K-means clustering via principal component analysis - Ding, He - 2004
65 Discovering evolutionary theme patterns from text: an exploration of temporal text mining - MEI, ZHAI - 2005
63 Spectral Graph Theory. Number 92 - Chung - 1997
52 Graphscope: Parameter-free mining of large time-evolving graphs - Sun, Papadimitriou, et al.
51 An updated set of basic linear algebra subprograms (blas - Blackford, Demmel, et al.
51 Automated image retrieval using color and texture - Smith, Chang - 1996
49 On a theorem of Weyl concerning eigenvalues of linear transformations - Fan - 1949
47 Weighted graph cuts without eigenvectors: a multilevel approach - Dhillon, Guan, et al.
47 Dynamic social network analysis using latent space models - Sarkar, Moore - 2005
42 Evolutionary clustering - CHAKRABARTI, KUMAR, et al. - 2006
40 A tutorial on spectral clustering - Luxburg - 2007
38 Evolutionary spectral clustering by incorporating temporal smoothness - CHI, SONG, et al. - 2007
36 Segmentation of 3d meshes through spectral clustering - Liu, Zhang - 2004
35 ARPACK users’ guide - Lehoucq, Sorensen, et al. - 1998
31 A portable implementation of ARPACK for distributed memory parallel architectures - Maschhoff, Sorensen - 1996
31 Clustering Moving Objects - Li, Han, et al. - 2004
30 Learning spectral clustering, with application to speech separation - Bach, Jordan
29 Improving the performance of collective operations - Thakur, Gropp - 2003
28 An event-based framework for characterizing the evolutionary behavior of interaction graphs - Asur, Parthasarathy, et al. - 2007
23 Document clustering with prior knowledge - Ji, Xu - 2006
22 Quantifying social group evolution., Nature 446 - Palla, Barabási, et al. - 2007
20 SLEPc: A Scalable and Flexible Toolkit for the Solution of Eigenvalue Problems - Hernandez, Roman, et al. - 2005
20 Monic: modeling and monitoring cluster transitions - SPILIOPOULOU, NTOUTSI, et al. - 2006
17 Genic: A single pass generalized incremental algorithm for clustering - GUPTA, R
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University