scientific article; zbMATH DE number 1333614
From MaRDI portal
Publication:4260388
zbMath0925.05053MaRDI QIDQ4260388
No author found.
Publication date: 19 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Multiway \(p\)-spectral graph cuts on Grassmann manifolds ⋮ A review on spectral clustering and stochastic block models ⋮ A survey of kernel and spectral methods for clustering ⋮ Unnamed Item ⋮ Decision-based scenario clustering for decision-making under uncertainty ⋮ Graph Bisection with Pareto Optimization ⋮ Partial differential equations and variational methods for geometric processing of images ⋮ Comparisons of different methods for balanced data classification under the discrete non-local total variational framework ⋮ Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications ⋮ Modified Cheeger and ratio cut methods using the Ginzburg–Landau functional for classification of high-dimensional data ⋮ Certifying global optimality of graph cuts via semidefinite relaxation: a performance guarantee for spectral clustering ⋮ SONET/SDH ring assignment with capacity constraints ⋮ Hearing the clusters of a graph: A distributed algorithm ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ Dynamical Systems Theory and Algorithms for NP-hard Problems ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs ⋮ Mean curvature, threshold dynamics, and phase field theory on finite graphs ⋮ Diffuse Interface Models on Graphs for Classification of High Dimensional Data ⋮ Improving Spectral Clustering Using the Asymptotic Value of the Normalized Cut ⋮ Clustered Matrix Approximation ⋮ A Performance Guarantee for Spectral Clustering ⋮ Minimum spectral connectivity projection pursuit. Divisive clustering using optimal projections for spectral clustering ⋮ Memetic Graph Clustering
