Scalable and Effective Negative Sample Generation for Hyperedge Prediction

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Qu, Shilin, Wang, Weiqing, Li, Yuan-Fang, Nguyen, Quoc Viet Hung, Yin, Hongzhi
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866915025991499776
author Qu, Shilin
Wang, Weiqing
Li, Yuan-Fang
Nguyen, Quoc Viet Hung
Yin, Hongzhi
author_facet Qu, Shilin
Wang, Weiqing
Li, Yuan-Fang
Nguyen, Quoc Viet Hung
Yin, Hongzhi
contents Hyperedge prediction is crucial in hypergraph analysis for understanding complex multi-entity interactions in various web-based applications, including social networks and e-commerce systems. Traditional methods often face difficulties in generating high-quality negative samples due to the imbalance between positive and negative instances. To address this, we present the Scalable and Effective Negative Sample Generation for Hyperedge Prediction (SEHP) framework, which utilizes diffusion models to tackle these challenges. SEHP employs a boundary-aware loss function that iteratively refines negative samples, moving them closer to decision boundaries to improve classification performance. SEHP samples positive instances to form sub-hypergraphs for scalable batch processing. By using structural information from sub-hypergraphs as conditions within the diffusion process, SEHP effectively captures global patterns. To enhance efficiency, our approach operates directly in latent space, avoiding the need for discrete ID generation and resulting in significant speed improvements while preserving accuracy. Extensive experiments show that SEHP outperforms existing methods in accuracy, efficiency, and scalability, representing a substantial advancement in hyperedge prediction techniques. Our code is available here.
format Preprint
id arxiv_https___arxiv_org_abs_2411_12354
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Scalable and Effective Negative Sample Generation for Hyperedge Prediction
Qu, Shilin
Wang, Weiqing
Li, Yuan-Fang
Nguyen, Quoc Viet Hung
Yin, Hongzhi
Information Retrieval
Hyperedge prediction is crucial in hypergraph analysis for understanding complex multi-entity interactions in various web-based applications, including social networks and e-commerce systems. Traditional methods often face difficulties in generating high-quality negative samples due to the imbalance between positive and negative instances. To address this, we present the Scalable and Effective Negative Sample Generation for Hyperedge Prediction (SEHP) framework, which utilizes diffusion models to tackle these challenges. SEHP employs a boundary-aware loss function that iteratively refines negative samples, moving them closer to decision boundaries to improve classification performance. SEHP samples positive instances to form sub-hypergraphs for scalable batch processing. By using structural information from sub-hypergraphs as conditions within the diffusion process, SEHP effectively captures global patterns. To enhance efficiency, our approach operates directly in latent space, avoiding the need for discrete ID generation and resulting in significant speed improvements while preserving accuracy. Extensive experiments show that SEHP outperforms existing methods in accuracy, efficiency, and scalability, representing a substantial advancement in hyperedge prediction techniques. Our code is available here.
title Scalable and Effective Negative Sample Generation for Hyperedge Prediction
topic Information Retrieval
url https://arxiv.org/abs/2411.12354