Fast Unsupervised Graph Embedding Based on Anchors

Fast Unsupervised Graph Embedding Based on Anchors

Graph embedding is a widely used method for dimensionality reduction due to its computational effectiveness.The computational complexity of graph embedding method to construct traditional K-Nearest Neighbors (K-NN) graph is at least O(n2d), where n and d represents the sample size and dimensions res...

Celý popis

Podrobná bibliografie
Hlavní autor: YANG Hui, TAO Li-hong, ZHU Jian-yong, NIE Fei-ping
Médium: Článek
Jazyk:zho
Vydáno: Editorial office of Computer Science 2022-04-01
Edice:Jisuanji kexue
Témata:
dimensionality reduction|graph embedding|anchors|<italic>k</italic>-means++|orthogonal constraint
On-line přístup:https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-4-116.pdf

Internet

https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-4-116.pdf

Podobné jednotky