Combinatorica
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Matrix computations (3rd ed.)
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Evaluation of hierarchical clustering algorithms for document datasets
Proceedings of the eleventh international conference on Information and knowledge management
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Spectral Partitioning of Random Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Spectral Analysis of Random Graphs with Skewed Degree Distributions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Spectral norm of random matrices
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A divide-and-merge methodology for clustering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A spectral heuristic for bisecting random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Spectral techniques applied to sparse random graphs
Random Structures & Algorithms
Fast solution of some random NP-hard problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Eigenvalues and graph bisection: An average-case analysis
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
An adaptive spectral heuristic for partitioning random graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On spectral learning of mixtures of distributions
COLT'05 Proceedings of the 18th annual conference on Learning Theory
An algorithm for improving graph partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A discriminative framework for clustering via similarity functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Clustering with Interactive Feedback
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Graph partitioning via adaptive spectral techniques
Combinatorics, Probability and Computing
Finding Planted Partitions in Random Graphs with General Degree Distributions
SIAM Journal on Discrete Mathematics
Left-Right oscillate algorithm for community detection used in e-learning system
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
| Hi-index | 0.00 |
In this paper, we analyze the second eigenvector technique of spectral partitioning on the planted partition random graph model, by constructing a recursive algorithm using the second eigenvectors in order to learn the planted partitions. The correctness of our algorithm is not based on the ratio-cut interpretation of the second eigenvector, but exploits instead the stability of the eigenvector subspace. As a result, we get an improved cluster separation bound in terms of dependence on the maximum variance. We also extend our results for a clustering problem in the case of sparse graphs.