When User Engagement Meets Structural Cohesiveness: A Decay-Driven Approach to Hypergraph Cores

Cohesive subgraph discovery in hypergraphs is essential for analysing complex group interactions in various domains such as e-commerce, social media, and collaboration networks. However, existing models are vulnerable to large hyperedges that artificially inflate connectivity, obscuring meaningful structure. We propose the (k,s)-core, a new model requiring each node to have at least k neighbours with a minimum interaction strength s, measured via a size-sensitive decay function. This penalises noisy co-occurrences while preserving strong local patterns. We develop an efficient algorithm with theoretical guarantees, and experiments on real-world datasets demonstrate improved compactness and robustness over prior methods.

• Publication year

  2025

• Venue

  International Conference on Information and Knowledge Management

• Publication date

  2025-11-10

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/3746252.3760845
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Survey on Hypergraph Mining: Patterns, Tools, and Generators

  2024cited by this paper
• Experimental analysis and evaluation of cohesive subgraph discovery

  2024cited by this paper
• A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guide

  2024cited by this paper
• Exploring Cohesive Subgraphs in Hypergraphs: The (k,g)-core Approach

  2023cited by this paper
• Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications

  2023cited by this paper
• Neighborhood-based Hypergraph Core Decomposition

  2023cited by this paper
• Hypergraph Artificial Benchmark for Community Detection (h-ABCD)

  2022cited by this paper
• A distributed hypergraph model for simulating the evolution of large coauthorship networks

  2021cited by this paper
• Double-Scale Self-Supervised Hypergraph Learning for Group Recommendation

  2021cited by this paper
• Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation

  2021cited by this paper
• Next-item Recommendation with Sequential Hypergraphs

  2020cited by this paper
• Hypergraph models of biological networks to identify genes critical to pathogenic viral response

  2020cited by this paper
• A Guide to Conquer the Biological Network Era Using Graph Theory

  2020cited by this paper
• Justifying Recommendations using Distantly-Labeled Reviews and Fine-Grained Aspects

  2019cited by this paper
• Community Detection in Hypergraphs: Optimal Statistical Limit and Efficient Algorithms

  2018cited by this paper
• Social network analysis: An overview

  2018cited by this paper
• A Discrete Choice Model for Subset Selection

  2018cited by this paper
• Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph

  2017cited by this paper
• Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core

  2017cited by this paper
• Hypergraph Theory: An Introduction

  2013cited by this paper
• An O(m) Algorithm for Cores Decomposition of Undirected Hypergraph

  2013cited by this paper
• Fast algorithms for determining (generalized) core groups in social networks

  2011cited by this paper
• Friendship and mobility: user movement in location-based social networks

  2011cited by this paper
• Social Network Analysis, Overview of

  2009cited by this paper
• Connecting the Congress: A Study of Cosponsorship Networks

  2006cited by this paper
• Legislative cosponsorship networks in the US House and Senate

  2006cited by this paper
• The Structure and Function of Complex Networks

  2003cited by this paper
• Neocortex size as a constraint on group size in primates

  1992cited by this paper
• Network structure and minimum degree

  1983cited by this paper
• The Number of Members as Determining the Sociological Form of the Group. I

  1902cited by this paper

• No citing papers are available for this paper.