Scalable and Effective Negative Sample Generation for Hyperedge Prediction
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Interpretable Subgraph Feature Extraction for Hyperlink Prediction
Conformation-Aware Structure Prediction of Antigen-Recognizing Immune Proteins
Cautious Next Token Prediction
Where, What, Why: Towards Explainable Driver Attention Prediction
Out-of-Distribution Semantic Occupancy Prediction
Demystifying Distributed Training of Graph Neural Networks for Link Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.