Nonlinear eigenproblems in data analysis: balanced graph cuts and the RatioDCA-Prox

DOI10.1007/978-3-319-08159-5_13MaRDI QIDQ5256564zbMATH OpenOpenAlexFDO

Authors Leonardo Jost, Matthias Hein, S. 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)

Abstract: It has been recently shown that a large class of balanced graph cuts allows for an exact relaxation into a nonlinear eigenproblem. We review briefly some of these results and propose a family of algorithms to compute nonlinear eigenvectors which encompasses previous work as special cases. We provide a detailed analysis of the properties and the convergence behavior of these algorithms and then discuss their application in the area of balanced graph cuts.

Recommendations

• Nonlinear eigenvector algorithms for local optimization in multivariate data analysis
• Algorithms for graph partitioning problems by means of eigenspace relaxations
• Community detection in networks via nonlinear modularity eigenvectors
• Flows generating nonlinear eigenfunctions
• Nonlinear eigenproblems in image processing and computer vision

Cited in

(9)

• LSV-based tail inequalities for sums of random matrices
• Locally unitarily invariantizable NEPv and convergence analysis of SCF
• On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
• Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects
• Nonlinear eigenvalue problems for seminorms and applications
• Comparisons of different methods for balanced data classification under the discrete non-local total variational framework
• Approximate normalized cuts without eigen-decomposition
• Sharp estimation of convergence rate for self-consistent field iteration to solve eigenvector-dependent nonlinear eigenvalue problems
• Interpolating self consistent field for eigenvector nonlinearities

This page was built for publication: Nonlinear eigenproblems in data analysis: balanced graph cuts and the RatioDCA-Prox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256564)