14 citations · 17 across the 3 of their papers we have counts for
3 papers
cs.LG2022★ 1 cited
Socially Fair Center-based and Linear Subspace Clustering
Sruthi Gorantla, Kishen N. Gowda, Amit Deshpande +1
Center-based clustering (e.g., -means, -medians) and clustering using linear subspaces are two most popular techniques to partition real-world data into smaller clusters. How…
cs.DM2014★ 2 cited
Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
Anand Louis
The celebrated Cheeger's Inequality \cite{am85,a86} establishes a bound on the expansion of a graph via its spectrum. This inequality is central to a rich spectral theory of graphs…
cs.DS2014★ 14 cited
Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion
Anand Louis, Yury Makarychev
The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined as the minimum over all cuts in the hypergraph of the ratio of the number of the…