On the eigenvectors of \(p\)-Laplacian

DOI10.1007/s10994-010-5201-zzbMath1470.68141OpenAlexW2096146461MaRDI QIDQ1959607

Feiping Nie, Dijun Luo, Chris H. Q. Ding, Heng Huang

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-010-5201-z

zbMATH Keywords

clustering\(p\)-Laplaciangraph Laplaciannormalized cutCheeger cut

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (8)

Multiway \(p\)-spectral graph cuts on Grassmann manifolds ⋮ Unsupervised robust discriminative manifold embedding with self-expressiveness ⋮ Consistency of Dirichlet Partitions ⋮ Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm ⋮ The signless \(p\)-Laplacian spectral radius of graphs with given degree sequences ⋮ The signless p-Laplacian spectral radius of graphs with given matching number ⋮ Image colorization by using graph bi-Laplacian ⋮ Efficient regularized spectral data embedding

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Riemannian approach to graph embedding
• Semi-supervised graph clustering: a kernel approach
• Resonance problems for \(p\)-Laplacian
• Bounds for the largest \(p\)-Laplacian eigenvalue for graphs
• A Picone's identity for the p-Laplacian and applications
• On the Quality of Spectral Separators
• Learning Theory

This page was built for publication: On the eigenvectors of \(p\)-Laplacian