SGTlight

swMATH24839MaRDI QIDQ36588FDOQ36588

Author name not available (Why is that?)

Cited In (32)

• A graph-based semi-supervised \(k\) nearest-neighbor method for nonlinear manifold distributed data classification
• Title not available (Why is that?)
• Robust classification of graph-based data
• Transductive hyperspectral image classification: toward integrating spectral and relational features via an iterative ensemble system
• Discrete temporal models of social networks
• On semi-supervised learning
• Learning Unknown Graphs
• Multi-view kernel construction
• Model-based transductive learning of the kernel matrix
• Model-based transductive learning of the kernel matrix
• Laplacian twin support vector machine for semi-supervised classification
• Semi-supervised learning using multiple one-dimensional embedding based adaptive interpolation
• Semi-supervised classification and betweenness computation on large, sparse, directed graphs
• Detecting and preventing error propagation via competitive learning
• Stochastic feature mapping for PAC-Bayes classification
• On multi-view learning with additive models
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Gaussian fields for semi-supervised regression and correspondence learning
• A second order cone programming approach for semi-supervised learning
• Fisher-regularized support vector machine
• Learning with Sequential Minimal Transductive Support Vector Machine
• A survey on semi-supervised learning
• Joint Use of Node Attributes and Proximity for Node Classification
• Predicting the labels of an unknown graph via adaptive exploration
• Support vector machine polyhedral separability in semisupervised learning
• Adaptive edge weighting for graph-based learning algorithms
• Semi-supervised learning using ensembles of multiple 1D-embedding-based label boosting
• Title not available (Why is that?)
• Auction dynamics: a volume constrained MBO scheme
• Convex variational methods on graphs for multiclass segmentation of high-dimensional data and point clouds
• A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors
• Learning to rank on graphs

This page was built for software: SGTlight