k-simplex2vec: a simplicial extension of node2vec

10/12/2020
by   Celia Hacker, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/06/2021

Higher-order motif analysis in hypergraphs

A deluge of new data on social, technological and biological networked s...
research
09/10/2018

Now You're Thinking With Structures: A Concept for Structure-based Interactions with Spreadsheets

Spreadsheets are the go-to tool for computerized calculation and modelli...
research
11/06/2020

A Simple Algorithm for Higher-order Delaunay Mosaics and Alpha Shapes

We present a simple algorithm for computing higher-order Delaunay mosaic...
research
10/10/2022

Hierarchical Learning in Euclidean Neural Networks

Equivariant machine learning methods have shown wide success at 3D learn...
research
03/13/2023

I Don't Care Anymore: Identifying the Onset of Careless Responding

Questionnaires in the behavioral and organizational sciences tend to be ...
research
06/12/2020

Explaining Local, Global, And Higher-Order Interactions In Deep Learning

We present a simple yet highly generalizable method for explaining inter...
research
03/15/2012

Approximating Higher-Order Distances Using Random Projections

We provide a simple method and relevant theoretical analysis for efficie...

Please sign up or login with your details

Forgot password? Click here to reset