3 citations · 3 across the 4 of their papers we have counts for
4 papers
Planted clique detection and recovery from the hypergraph adjacency matrix
Kalle Alaluusua, B. R. Vinay Kumar
Hypergraph data are often projected onto a weighted graph by constructing an adjacency matrix whose entry counts the number of hyperedges containing both nodes and .…
Consistent line clustering using geometric hypergraphs
Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar +1
Subspace clustering becomes inherently difficult near intersections, where points from different subspaces are barely separated. Most existing theoretical results address this issu…
Multilayer hypergraph clustering using the aggregate similarity matrix
Kalle Alaluusua, Konstantin Avrachenkov, B. R. Vinay Kumar +1
We consider the community recovery problem on a multilayer variant of the hypergraph stochastic block model (HSBM). Each layer is associated with an independent realization of a d-…
Consistent Bayesian community recovery in multilayer networks
Kalle Alaluusua, Lasse Leskelä
Revealing underlying relations between nodes in a network is one of the most important tasks in network analysis. Using tools and techniques from a variety of disciplines, many com…