Clustering large graphs via the singular value decomposition
From MaRDI portal
Publication:703073
DOI10.1023/B:MACH.0000033113.59016.96zbMATH Open1089.68090OpenAlexW2004791924WikidataQ55921971 ScholiaQ55921971MaRDI QIDQ703073FDOQ703073
Authors: V. Vinay, Petros Drineas, Alan Frieze, R. Kannan, Santosh S. Vempala 
Publication date: 19 January 2005
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:mach.0000033113.59016.96
Recommendations
Cited In (68)
- Title not available (Why is that?)
- k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts
- Multiple Nested Reductions of Single Data Modes as a Tool to Deal with Large Data Sets
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
- Visualizing large graphs
- How to find a good explanation for clustering?
- Understanding singular vectors
- The Parallel Seeding Algorithm for k-Means Problem with Penalties
- The provably good parallel seeding algorithms for the k‐means problem with penalties
- Minimizing the size of the uncertainty regions for centers of moving entities
- The seeding algorithms for spherical \(k\)-means clustering
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- ORCA: outlier detection and robust clustering for attributed graphs
- SVD, discrepancy, and regular structure of contingency tables
- Far-field compression for fast kernel summation methods in high dimensions
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Title not available (Why is that?)
- A New Troubled-Cell Indicator for Discontinuous Galerkin Methods Using K-Means Clustering
- Point clustering via voting maximization
- Singular value decomposition in additive, multiplicative, and logistic forms
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- A Sparse Stress Model
- Efficient methods for grouping vectors into low-rank clusters
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- On the isoperimetric spectrum of graphs and its approximations
- The planar \(k\)-means problem is NP-hard
- The seeding algorithm for spherical \(k\)-means clustering with penalties
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Asymptotic regularity of subdivisions of Euclidean domains by iterated PCA and iterated 2-means
- The complexity status of problems related to sparsest cuts
- Recognizing linear structure in noisy matrices
- Title not available (Why is that?)
- Embedding-based silhouette community detection
- On constrained spectral clustering and its applications
- An approximation ratio for biclustering
- A selection process for genetic algorithm using clustering analysis
- Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference
- Title not available (Why is that?)
- The Planar k-Means Problem is NP-Hard
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- The complexity of finding uniform sparsest cuts in various graph classes
- Multidimensional partitioning and bi-partitioning: analysis and application to gene expression data sets
- Regularity of densities in relaxed and penalized average distance problem
- A survey on feature weighting based K-means algorithms
- Robust K-Median and K-means clustering algorithms for incomplete data
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space
- \(k\)-Mnv-Rep: a \(k\)-type clustering algorithm for matrix-object data
- PCA and SVD with nonnegative loadings
- HC\_AB: a new heuristic clustering algorithm based on approximate backbone
- Stochastic algorithms in linear algebra -- beyond the Markov chains and von Neumann-Ulam scheme
- Global optimality in \(k\)-means clustering
- Concept decompositions for large sparse text data using clustering
- Matrix recipes for hard thresholding methods
- An improved primal-dual approximation algorithm for the k-means problem with penalties
- Graph clustering
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- The singular values and vectors of low rank perturbations of large rectangular random matrices
- An approximation algorithm for the uniform capacitated \(k\)-means problem
- The bi-criteria seeding algorithms for two variants of \(k\)-means problem
- Anomaly detection in large-scale data stream networks
- The seeding algorithm for \(k\)-means problem with penalties
- NP-hardness of Euclidean sum-of-squares clustering
- Structural conditions for projection-cost preservation via randomized matrix multiplication
- On the complexity of some problems of searching for a family of disjoint clusters
- Exemplar-based low-rank matrix decomposition for data clustering
- On the information and representation of non-Euclidean pairwise data
- Approximation algorithms for fuzzy \(C\)-means problem based on seeding method
- Title not available (Why is that?)
This page was built for publication: Clustering large graphs via the singular value decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703073)
