arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2504.00522cs.DBcs.LG
收藏

MARIOH:多重性感知的超图重构

MARIOH: Multiplicity-Aware Hypergraph Reconstruction

Kim Jaechul Graduate School of AI, KAIST, Seoul, Republic of Korea(韩国科学技术院(KAIST)人工智能研究生院);GraphAI, Daejeon, Republic of Korea(韩国大田GraphAI)

Kyuhan Lee, Geon Lee, Kijung Shin

AI总结:

MARIOH提出一种利用边多重性从投影图重构原始超图的监督方法,通过识别可证明的规模为2超边、结合结构与多重性特征预测候选超边,并探索低置信度候选,在10个真实数据集上实现最高74.51%的重构准确率提升。

摘要:

超图为建模传统成对图无法完全捕捉的高阶交互提供了强大框架。然而,实际约束常常导致其被简化为投影图,从而在表示高阶关系时造成大量信息损失和歧义。在本工作中,我们提出MARIOH,一种利用边多重性从投影图重构原始超图的监督方法。为克服庞大搜索空间带来的困难,MARIOH整合了几个关键思想:(a) 识别可证明的规模为2的超边,从而缩小候选搜索空间;(b) 利用结构特征和多重性相关特征预测候选对象成为超边的可能性;(c) 不仅针对有前景的超边候选对象,还检查置信度较低的候选对象以探索替代可能性。这些思想共同使MARIOH能够高效且有效地探索搜索空间。在我们使用10个真实世界数据集的实验中,与最先进方法相比,MARIOH的重构准确率最高提升了74.51%。

英文摘要:

Hypergraphs offer a powerful framework for modeling higher-order interactions that traditional pairwise graphs cannot fully capture. However, practical constraints often lead to their simplification into projected graphs, resulting in substantial information loss and ambiguity in representing higher-order relationships. In this work, we propose MARIOH, a supervised approach for reconstructing the original hypergraph from its projected graph by leveraging edge multiplicity. To overcome the difficulties posed by the large search space, MARIOH integrates several key ideas: (a) identifying provable size-2 hyperedges, which reduces the candidate search space, (b) predicting the likelihood of candidates being hyperedges by utilizing both structural and multiplicity-related features, and (c) not only targeting promising hyperedge candidates but also examining less confident ones to explore alternative possibilities. Together, these ideas enable MARIOH to efficiently and effectively explore the search space. In our experiments using 10 real-world datasets, MARIOH achieves up to 74.51% higher reconstruction accuracy compared to state-of-the-art methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑