AHP: Learning to Negative Sample for Hyperedge Prediction
Hypergraphs (i.e., sets of hyperedges) naturally represent group relations (e.g., researchers co-authoring a paper and ingredients used together in a recipe), each of which corresponds to a hyperedge (i.e., a subset of nodes). Predicting future or missing hyperedges bears significant implications for many applications (e.g., collaboration and recipe recommendation). What makes hyperedge prediction particularly challenging is the vast number of non-hyperedge subsets, which grows exponentially with the number of nodes. Since it is prohibitive to use all of them as negative examples for model training, it is inevitable to sample a very small portion of them, and to this end, heuristic sampling schemes have been employed. However, trained models suffer from poor generalization capability for examples of different natures. In this paper, we propose AHP, an adversarial training-based hyperedge-prediction method. It learns to sample negative examples without relying on any heuristic schemes. Using six real hypergraphs, we show that AHP generalizes better to negative examples of various natures. It yields up to 28.2% higher AUROC than the best existing methods and often even outperforms its variants with sampling schemes tailored to test sets.
Code (1)
Tasks
Hyperedge PredictionPredictionSimilar Papers 제목 키워드 기반
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 fa…
Hyperedge PredictionPredictionHyGEN: Regularizing Negative Hyperedge Generation for Accurate Hyperedge Prediction
Hyperedge prediction is a fundamental task to predict future high-order relations based on the observed network structure. Existing hyperedge prediction methods, however, suffer from the data sparsity problem. To allevia…
Hyperedge PredictionPredictionEnhancing Hyperedge Prediction with Context-Aware Self-Supervised Learning
Hypergraphs can naturally model group-wise relations (e.g., a group of users who co-purchase an item) as hyperedges. Hyperedge prediction is to predict future or unobserved hyperedges, which is a fundamental task in many…
Contrastive LearningHyperedge PredictionHypergraph representationsPrediction+1k-HyperEdge Medoids for Clustering Ensemble
Clustering ensemble has been a popular research topic in data science due to its ability to improve the robustness of the single clustering method. Many clustering ensemble methods have been proposed, most of which can b…
ClusteringClustering EnsembleDeep Representation Learning for Forecasting Recursive and Multi-Relational Events in Temporal Networks
Understanding relations arising out of interactions among entities can be very difficult, and predicting them is even more challenging. This problem has many applications in various fields, such as financial networks and…
DecoderGraph Representation LearningLink PredictionRepresentation Learning