Spectral Clustering by Recursive Partitioning

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Embedded Systems and Applications

• Publication date

  2006-09-11

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11841036_25
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Eigenvalues of Non-Backtracking Walks in a Cycle with Random Loops

  2007cited by this paper
• An Adaptive Spectral Heuristic for Partitioning Random Graphs

  2006cited by this paper
• On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

  2006cited by this paper
• On Spectral Learning of Mixtures of Distributions

  2005cited by this paper
• A divide-and-merge methodology for clustering

  2005cited by this paper
• Spectral techniques applied to sparse random graphs

  2005cited by this paper
• Spectral norm of random matrices

  2005cited by this paper
• Spectral analysis of random graphs with skewed degree distributions

  2004cited by this paper
• A Comparison of Spectral Clustering Algorithms

  2003cited by this paper
• Evaluation of hierarchical clustering algorithms for document datasets

  2002cited by this paper
• Spectral analysis of data

  2001cited by this paper
• Spectral partitioning of random graphs

  2001cited by this paper
• On clusterings-good, bad and spectral

  2000cited by this paper
• Matrix Computations, Third Edition

  1996cited by this paper
• Spectral partitioning works: planar graphs and finite element meshes

  1996cited by this paper
• Matrix computations (3rd ed.)

  1996cited by this paper
• Proceedings of the 30th IEEE symposium on Foundations of computer science

  1994cited by this paper
• A Spectral Technique for Coloring Random 3-Colorable Graphs

  1994cited by this paper
• Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved

  1988cited by this paper
• Eigenvalues and graph bisection: An average-case analysis

  1987cited by this paper
• Fast solution of some random NP-hard problems

  1986cited by this paper
• Eigenvalues and expanders

  1986cited by this paper
• Graph bisection algorithms with good average case behavior

  1984cited by this paper
• Matrix computations

  1983cited by this paper
• The eigenvalues of random symmetric matrices

  1981cited by this paper
• On Observing Nondeterminism and Concurrency

  1980cited by this paper
• Algebraic connectivity of graphs

  1973cited by this paper

• Community Detection through Recursive Partitioning in Bayesian Framework

  2025cites this paper
• T-Stochastic Graphs

  2023cites this paper
• When Does Bottom-up Beat Top-down in Hierarchical Community Detection?

  2023cites this paper
• IbLT: An effective granular computing framework for hierarchical community detection

  2021cites this paper
• A Deep Learning Framework for Self-evolving Hierarchical Community Detection

  2021cites this paper
• Deep Learning & Graph Clustering for Maritime Logistics: Predicting Destination and Expected Time of Arrival for Vessels Across Europe

  2020influential citation
• Revisiting spectral clustering for near-convex decomposition of 2D shape

  2020cites this paper
• Consistency of Spectral Clustering on Hierarchical Stochastic Block Models

  2020cites this paper
• Structural and developmental principles of neuropil assembly in C. elegans

  2020cites this paper
• Stochastic Systems

  2020cites this paper
• Coarse Graining of Data via Inhomogeneous Diffusion Condensation

  2019cites this paper
• Unified $\ell_{2\rightarrow\infty}$ Eigenspace Perturbation Theory for Symmetric Random Matrices

  2019cites this paper
• Hierarchical Community Detection by Recursive Partitioning

  2018influential citation
• An Analysis of the t-SNE Algorithm for Data Visualization

  2018cites this paper
• Analysis of spectral clustering algorithms for community detection: the general bipartite setting

  2018cites this paper
• Hierarchical community detection by recursive bi-partitioning

  2018cites this paper
• Graphons: A Nonparametric Method to Model, Estimate, and Design Algorithms for Massive Networks

  2017cites this paper
• Algorithms and Complexity Results for Learning and Big Data

  2017cites this paper
• Semi-supervised clustering techniques for categorization of text documents

  2015cites this paper
• Interactive Clustering of Linear Classes and Cryptographic Lower Bounds

  2015cites this paper
• Consistent nonparametric estimation for heavy-tailed sparse graphs

  2015cites this paper
• Streaming, Memory Limited Algorithms for Community Detection

  2014cites this paper
• Power Iterated Color Refinement

  2014cites this paper
• Community Detection via Random and Adaptive Sampling

  2014cites this paper
• Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence

  2014cites this paper
• Spectral Clustering: Left-Right-Oscillate Algorithm for Detecting Communities

  2013cites this paper
• Left-Right Oscillate Algorithm for Community Detection Used in E-Learning System

  2012cites this paper
• Spectral Clustering: Left-Right-Oscillate Algorithm for Detecting Communities

  2012cites this paper
• Combined Method for Effective Clustering based on Parallel SOM and Spectral Clustering

  2011cites this paper
• Robust clustering algorithms

  2011cites this paper
• Analysis of Social Networks Extracted from Log Files

  2010influential citation
• Using Spectral Clustering for Finding Students' Patterns of Behavior in Social Networks

  2010cites this paper
• Distributed user profiling via spectral methods

  2010cites this paper
• Finding Planted Partitions in Random Graphs with General Degree Distributions

  2009cites this paper
• A voting approach to learn affinity matrix for robust clustering

  2009cites this paper
• Graph Partitioning via Adaptive Spectral Techniques

  2009cites this paper
• Entrywise Bounds for Eigenvectors of Random Graphs

  2009cites this paper
• Interactive Clustering

  2009cites this paper
• Efficient clustering via spectral and linear programming methods

  2008cites this paper
• Clustering via Similarity Functions : Theoretical Foundations and Algorithms ∗

  2008cites this paper
• A discriminative framework for clustering via similarity functions

  2008cites this paper
• New theoretical frameworks for machine learning

  2008cites this paper
• Clustering algorithms for random and pseudo-random structures

  2008influential citation
• Clustering with Interactive Feedback

  2008cites this paper
• An algorithm for improving graph partitions

  2008cites this paper
• A Theory of Similarity Functions for Clustering

  2007cites this paper
• A Learning Theoretic Framework for Clustering with Similarity Functions

  2007cites this paper
• Spectral clustering for multi-type relational data

  2006cites this paper