10 citations · 24 across the 16 of their papers we have counts for
Showing 2018 · stat.MLShow all
2 papers · 2 filters
stat.ML2018
Constructing Graph Node Embeddings via Discrimination of Similarity Distributions
Stanislav Tsepa, Maxim Panov
The problem of unsupervised learning node embeddings in graphs is one of the important directions in modern network science. In this work we propose a novel framework, which is aim…
stat.ML2018
Sparse Group Inductive Matrix Completion
Ivan Nazarov, Boris Shirokikh, Maria Burkina +2
We consider the problem of matrix completion with side information (\textit{inductive matrix completion}). In real-world applications many side-channel features are typically non-i…