图 书 馆
结构保持嵌入Structure Preserving Embedding |
|
| 课程网址: | http://videolectures.net/icml09_shaw_spe/ |
| 主讲教师: | 结构保持嵌入 |
| 开课单位: | 哥伦比亚大学 |
| 开课时间: | 2009-08-26 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Structure Preserving Embedding (SPE) is an algorithm for embedding graphs in Euclidean space such that the embedding is lowdimensional and preserves the global topological properties of the input graph. Topology is preserved if a connectivity algorithm, such as k-nearest neighbors, can easily recover the edges of the input graph from only the coordinates of the nodes after embedding. SPE is formulated as a semidefinite program that learns a low-rank kernel matrix constrained by a set of linear inequalities which captures the connectivity structure of the input graph. Traditional graph embedding algorithms do not preserve structure according to our definition, and thus the resulting visualizations can be misleading or less informative. SPE provides significant improvements in terms of visualization and lossless compression of graphs, outperforming popular methods such as spectral embedding and Laplacian eigenmaps. We find that many classical graphs and networks can be properly embedded using only a few dimensions. Furthermore, introducing structure preserving constraints into dimensionality reduction algorithms produces more accurate representations of highdimensional data. |
| 关 键 词: | 结构保持嵌入; 全局拓扑特性; 降维算法 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2022-11-06：chenjy |
| 最后编审: | 2022-11-06：chenjy |
| 阅读次数: | 34 |