1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LG2021
An Impossibility Theorem for Node Embedding
T. Mitchell Roddenberry, Yu Zhu, Santiago Segarra
With the increasing popularity of graph-based methods for dimensionality reduction and representation learning, node embedding functions have become important objects of study in t…
cs.DS2021★ 1 cited
Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning
Yu Zhu, Boning Li, Santiago Segarra
We propose a novel method to co-cluster the vertices and hyperedges of hypergraphs with edge-dependent vertex weights (EDVWs). In this hypergraph model, the contribution of every v…