Nonlinear Eigenproblems in Data Analysis: Balanced Graph Cuts and the RatioDCA-Prox

DOI10.1007/978-3-319-08159-5_13zbMath1329.68218arXiv1312.5192OpenAlexW1817816559MaRDI QIDQ5256564

Matthias Hein, Leonardo Jost, Simon Setzer

Publication date: 18 June 2015

Published in: Extraction of Quantifiable Information from Complex Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.5192

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items (5)

Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects ⋮ LSV-Based Tail Inequalities for Sums of Random Matrices ⋮ On an Eigenvector-Dependent Nonlinear Eigenvalue Problem ⋮ Interpolating self consistent field for eigenvector nonlinearities ⋮ Sharp Estimation of Convergence Rate for Self-Consistent Field Iteration to Solve Eigenvector-Dependent Nonlinear Eigenvalue Problems

This page was built for publication: Nonlinear Eigenproblems in Data Analysis: Balanced Graph Cuts and the RatioDCA-Prox