Generalizing diffuse interface methods on graphs: non-smooth potentials and hypergraphs
Diffuse interface methods have recently been introduced for the task of semi-supervised learning. The underlying model is well-known in materials science but was extended to graphs using a Ginzburg--Landau functional and the graph Laplacian. We here generalize the previously proposed model by a non-smooth potential function. Additionally, we show that the diffuse interface method can be used for the segmentation of data coming from hypergraphs. For this we show that the graph Laplacian in almost all cases is derived from hypergraph information. Additionally, we show that the formerly introduced hypergraph Laplacian coming from a relaxed optimization problem is well suited to be used within the diffuse interface method. We present computational experiments for graph and hypergraph Laplacians.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Multiclass Semi-Supervised Learning on Graphs using Ginzburg-Landau Functional Minimization
We present a graph-based variational algorithm for classification of high-dimensional data, generalizing the binary diffuse interface model to the case of multiple classes. Motivated by total variation techniques, the me…
ClassificationGeneral ClassificationNode Classification for Signed Social Networks Using Diffuse Interface Methods
Signed networks contain both positive and negative kinds of interactions like friendship and enmity. The task of node classification in non-signed graphs has proven to be beneficial in many real world applications, yet e…
ClassificationGeneral ClassificationNode ClassificationSemi-supervised Learning for Aggregated Multilayer Graphs Using Diffuse Interface Methods and Fast Matrix Vector Products
We generalize a graph-based multiclass semi-supervised classification technique based on diffuse interface methods to multilayer graphs. Besides the treatment of various applications with an inherent multilayer structure…
Image SegmentationSemantic SegmentationBlind Demixing of Diffused Graph Signals
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the …
blind source separationMulticlass Data Segmentation using Diffuse Interface Methods on Graphs
We present two graph-based algorithms for multiclass segmentation of high-dimensional data. The algorithms use a diffuse interface model based on the Ginzburg-Landau functional, related to total variation compressed sens…
compressed sensingSegmentation