Efficient dynamic graph construction for inductive semi-supervised learning

DOI10.1016/J.NEUNET.2017.07.006MaRDI QIDQ2292233zbMATH OpenOpenAlexWikidataFDO

Authors F. Dornaika, R. Dahbi, A. Bosaghzadeh, Yassine Ruichek

Publication date 3 February 2020

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2017.07.006

zbMATH Keywords

data self-representativeness graph constructiongraph-based semi-supervised learningincremental graph constructioninductive semi-supervised learningmultiple observations

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Supervised neighborhood graph construction for semi-supervised classification
• Adaptive edge weighting for graph-based learning algorithms
• A multilevel approach for learning from labeled and unlabeled data on graphs
• Adaptive graph construction using data self-representativeness for pattern classification
• Learning Theory

Cites work

• Adaptive graph construction using data self-representativeness for pattern classification
• Dynamic Facial Expression Recognition With Atlas Construction and Sparse Representation
• Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection
• Graph-optimized locality preserving projections
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Learning with $\ell ^{1}$-graph for image analysis

Cited in

(4)

• On the theory of dynamic graph regression problem
• Adaptive edge weighting for graph-based learning algorithms
• GSM: inductive learning on dynamic graph embeddings
• Automatic annotation of a dynamic corpus by label propagation

This page was built for publication: Efficient dynamic graph construction for inductive semi-supervised learning

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