返回
Unsupervised Optimized Bipartite Graph Embedding
DOI:10.1109/TKDE.2021.3115775.png)
摘要
En 中文
Graph embedding is a widely used method for dimensionality reduction due to its computational effectiveness. The quality of the graph and the efficiency of graph construction will directly affect the performance and the efficiency of the graph embedding methods. However, in the unsupervised graph embedding methods, the graph is not considered as an optimized graph since there is no label that can be used to construct this graph. In addition, the running of traditional graph embedding methods becomes very time-consuming on large-scale datasets due to the high computational cost in the step of graph construction. Aiming to solve these problems, we propose an unsupervised dimensionality reduction method based on bipartite graph, called Unsupervised Optimized Bipartite Graph Embedding (UOBGE). Representative anchors are first identified in the data. Then, we construct the bipartite graph between the projected samples and the projected anchors and the intrinsic graph connecting all the projected sample pairs with equal weights, which keep the local and global geometric structures of the data, respectively. Finally, the bipartite graph and the projection matrix are optimized simultaneously by introducing an alternating optimization procedure. Extensive experiments on several datasets demonstrate the effectiveness and efficiency of the proposed method.
Keyword:
Dimensionality reduction
graph embedding framework
bipartite graph
anchors
K-means plus
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Prediction of Pregabalin-Mediated Pain Response by Severity of Sleep Disturbance in Patients with Painful Diabetic Neuropathy and Post-Herpetic Neuralgia疼痛性糖尿病神经病变和带状疱疹后神经痛患者睡眠障碍严重程度预测普瑞巴林介导的疼痛反应
Statistical monitoring of fed-batch process using dynamic multiway neighborhood preserving embedding使用动态多路邻域保持嵌入对分批过程进行统计监控

