k-simplex2vec: a simplicial extension of node2vec
Machine Learning
2021-01-13 v2 Algebraic Topology
Abstract
We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher dimensions, providing insight into the structure of a simplicial complex, or into the higher-order interactions in a graph.
Keywords
Cite
@article{arxiv.2010.05636,
title = {k-simplex2vec: a simplicial extension of node2vec},
author = {Celia Hacker},
journal= {arXiv preprint arXiv:2010.05636},
year = {2021}
}