arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.07996cs.DB
收藏

VerSaChI:使用Chebyshev不等式查找统计显著子图匹配

VerSaChI: Finding Statistically Significant Subgraph Matches using Chebyshev's Inequality

Shubhangi Agarwal, Sourav Dutta, Arnab Bhattacharya

摘要:

近似子图匹配是问答、社区发现和基序发现等应用的重要基础,通常涉及大型标记图,如知识图谱、社交网络和蛋白质序列。有效的方法来提取匹配的子图,在标签和结构相似性的查询,应该描述的准确性,计算效率和鲁棒性的噪音。在本文中,我们提出了VerSaChI的基础上找到的top-k最相似的子图的2跳标签和结构重叠相似的查询。利用Chebyshev不等式计算卡方统计显著性来度量子图的匹配程度。在真实图形数据集上的实验显示,与最先进的方法相比,该方法在准确性以及对噪声的鲁棒性方面都有显着提高。

英文摘要:

Approximate subgraph matching, which is an important primitive for many applications like question answering, community detection, and motif discovery, often involves large labeled graphs such as knowledge graphs, social networks, and protein sequences. Effective methods for extracting matching subgraphs, in terms of label and structural similarities to a query, should depict accuracy, computational efficiency, and robustness to noise. In this paper, we propose VerSaChI for finding the top-k most similar subgraphs based on 2-hop label and structural overlap similarity with the query. The similarity is characterized using Chebyshev's inequality to compute the chi-square statistical significance for measuring the degree of matching of the subgraphs. Experiments on real-life graph datasets showcase significant improvements in terms of accuracy compared to state-of-the-art methods, as well as robustness to noise.

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

↑