arXiv:1902.10414
Computing Nonlinear Eigenfunctions via Gradient Flow Extinction
원문 초록
In this work we investigate the computation of nonlinear eigenfunctions via the extinction profiles of gradient flows. We analyze a scheme that recursively subtracts such eigenfunctions from given data and show that this procedure yields a decomposition of the data into eigenfunctions in some cases as the 1-dimensional total variation, for instance. We discuss results of numerical experiments in which we use extinction profiles and the gradient flow for the task of spectral graph clustering as used, e.g., in machine learning applications.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
An Internal Validity Index Based on Density-Involved Distance
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Unsupervised Graph Clustering with Deep Structural Entropy
Imputation-free and Alignment-free: Incomplete Multi-view Clustering Driven by Consensus Semantic Learning
Rhomboid Tiling for Geometric Graph Deep Learning
HAECcity: Open-Vocabulary Scene Understanding of City-Scale Point Clouds with Superpoint Graph Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.