6 citations · 24 across the 21 of their papers we have counts for
4 papers · 1 filter
Faster Inference of Cell Complexes from Flows via Matrix Factorization
Til Spreuer, Josef Hoppe, Michael T. Schaub
We consider the following inference problem: Given a set of edge-flow signals observed on a graph, lift the graph to a cell complex, such that the observed edge-flow signals can be…
Topological Trajectory Classification and Landmark Inference on Simplicial Complexes
Vincent P. Grande, Josef Hoppe, Florian Frantzen +1
We consider the problem of classifying trajectories on a discrete or discretised 2-dimensional manifold modelled by a simplicial complex. Previous works have proposed to project th…
Ellipsoidal embeddings of graphs
Michaël Fanuel, Antoine Aspeel, Michael T. Schaub +1
Due to their flexibility to represent almost any kind of relational data, graph-based models have enjoyed a tremendous success over the past decades. While graphs are inherently on…
Representing Edge Flows on Graphs via Sparse Cell Complexes
Josef Hoppe, Michael T. Schaub
Obtaining sparse, interpretable representations of observable data is crucial in many machine learning and signal processing tasks. For data representing flows along the edges of a…