.png){kind=icon}
Return
Unsupervised Optimized Bipartite Graph Embedding
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2021.3115775.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Dimensionality reduction
graph embedding framework
bipartite graph
anchors
K-means plus
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
Cited Papers
.png){kind=icon}
Statistical monitoring of fed-batch process using dynamic multiway neighborhood preserving embedding
PREAI
ShareSavePassive signal propagation and membrane properties in median photoreceptors of the giant barnacle
OAAI
OAAIShareSaveShareSave
View more