A graph-based semi-supervised \(k\) nearest-neighbor method for nonlinear manifold distributed data classification

DOI10.1016/J.INS.2016.07.016zbMath1428.68259DBLPjournals/isci/TuZZYK16arXiv1606.00985OpenAlexW2964003344WikidataQ60502489 ScholiaQ60502489MaRDI QIDQ2282041

Jie Yang, Lin Zhu, Yaqian Zhang, Enmei Tu, Nikola K. Kasabov

Publication date: 6 January 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.00985

zbMATH Keywords

\(k\) nearest neighborssemi-supervised learningconstrained tired random walkmanifold classification

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Sums of independent random variables; random walks (60G50) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

HesGCN: Hessian graph convolutional networks for semi-supervised classification ⋮ Online semi-supervised support vector machine ⋮ Distributed online semi-supervised support vector machine ⋮ Semi-supervised cross-entropy clustering with information bottleneck constraint

Uses Software

• SGTlight
• LMNN

Cites Work

• Dimensional reduction in constrained global optimization on smooth manifolds
• Scaling universalities of \(k\)th-nearest neighbor distances on closed manifolds
• Intrinsic dimension estimation: advances and open problems
• Dimensionality reduction for data of unknown cluster structure
• Nonnegative Local Coordinate Factorization for Image Representation
• Nearest neighbor pattern classification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A graph-based semi-supervised \(k\) nearest-neighbor method for nonlinear manifold distributed data classification