最適化問題に対する超高速&安定計算

大規模最適化問題、グラフ探索、機械学習やデジタルツインなどの研究のお話が中心

Nested Subspace Arrangement for Representation of Relational Data

2020年09月11日 23時34分33秒 | Weblog
Nested Subspace Arrangement for Representation of Relational Data
Part of Proceedings of the International Conference on Machine Learning 119 pre-proceedings (ICML 2020)

Authors
Nozomi Hata, Shizuo Kaji, Akihiro Yoshida, Katsuki Fujisawa

Abstract
Studies of acquiring appropriate continuous representations of a discrete objects such as graph and knowledge based data have been conducted by many researches in the field of machine learning. In this paper, we introduce Nested SubSpace arrangement (NSS arrangement), a comprehensive framework for representation learning. We show that existing embedding techniques can be regarded as a member of NSS arrangement. Based on the concept of the NSS arrangement, we implemented Disk-ANChor ARrangement (DANCAR), a representation learning method specializing to reproduce general graphs. Numerical experiments have shown that DANCAR has successfully embedded WordNet in ${\mathbb R}^{20}$ with the F1 score of 99.3\% in the reconstruction task. DANCAR is also suitable for visualization to understand the characteristics of graph.
コメント
  • X
  • Facebookでシェアする
  • はてなブックマークに追加する
  • LINEでシェアする