# Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach

arXiv: https://arxiv.org/abs/2309.04350 · HTML: https://mlsanity.com/paper/2309.04350/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Sep 2023.

## Built on by (most cited first, 1 of 1)

- [Identifying Group Anchors in Real-World Group Interactions Under Label Scarcity](https://mlsanity.com/paper/2509.20762/) (2025)

## Abstract (arXiv)

Identifying cohesive subgraphs in hypergraphs is a fundamental problem that has received recent attention in data mining and engineering fields. Existing approaches mainly focus on a strongly induced subhypergraph or edge cardinality, overlooking the importance of the frequency of co-occurrence. In this paper, we propose a new cohesive subgraph named (k,g)-core, which considers both neighbour and co-occurrence simultaneously. The (k,g)-core has various applications including recommendation system, network analysis, and fraud detection. To the best of our knowledge, this is the first work to combine these factors. We extend an existing efficient algorithm to find solutions for (k,g)-core. Finally, we conduct extensive experimental studies that demonstrate the efficiency and effectiveness of our proposed algorithm.