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

FLEXIS:基于最大独立集的灵活频繁子图挖掘

FLEXIS: FLEXible Frequent Subgraph Mining using Maximal Independent Sets

Akshit Sharma, Sam Reinher, Dinesh Mehta, Bo Wu

AI总结:

本文提出FLEXIS方法,通过组合频繁(k-1)顶点模式识别k顶点模式,并采用最大独立集度量验证模式频率,相比GraMi和T-FSM分别实现平均10.58倍和3倍加速。

摘要:

频繁子图挖掘(FSM)是识别超过预定义频率阈值的常见子图模式的过程。虽然FSM在生物信息学、化学分析和社交网络异常检测等领域具有广泛适用性,但其执行仍然耗时且复杂。这种复杂性源于需要识别高频子图并确定它们是否超过设定阈值。当前识别这些模式的方法通常依赖边扩展或顶点扩展方法。然而,这些策略可能引入冗余并导致延迟增加。为了解决这些挑战,本文提出了一种新颖的方法,通过组合两个频繁出现的(k-1)顶点模式来识别潜在的k顶点模式。该方法优化了广度优先搜索,允许基于顶点数量和支持度值更快地终止搜索。FSM中的另一个挑战是根据特定阈值验证假定模式。现有度量标准,如最大独立集(MIS)和最小节点图像(MNI),要么需要大量计算时间,要么存在高估模式计数的风险。我们的创新方法与MIS保持一致,并识别独立子图。通过“最大独立集”度量,本文提供了一种高效的解决方案,可最小化延迟并为用户提供对模式重叠的控制。通过大量实验,我们提出的方法与GraMi相比平均实现了10.58倍的加速,与T-FSM相比平均实现了3倍的加速。

英文摘要:

Frequent Subgraph Mining (FSM) is the process of identifying common subgraph patterns that surpass a predefined frequency threshold. While FSM is widely applicable in fields like bioinformatics, chemical analysis, and social network anomaly detection, its execution remains time-consuming and complex. This complexity stems from the need to recognize high-frequency subgraphs and ascertain if they exceed the set threshold. Current approaches to identifying these patterns often rely on edge or vertex extension methods. However, these strategies can introduce redundancies and cause increased latency. To address these challenges, this paper introduces a novel approach for identifying potential k-vertex patterns by combining two frequently observed (k - 1)-vertex patterns. This method optimizes the breadth-]first search, which allows for quicker search termination based on vertices count and support value. Another challenge in FSM is the validation of the presumed pattern against a specific threshold. Existing metrics, such as Maximum Independent Set (MIS) and Minimum Node Image (MNI), either demand significant computational time or risk overestimating pattern counts. Our innovative approach aligns with the MIS and identifies independent subgraphs. Through the "Maximal Independent Set" metric, this paper offers an efficient solution that minimizes latency and provides users with control over pattern overlap. Through extensive experimentation, our proposed method achieves an average of 10.58x speedup when compared to GraMi and an average 3x speedup when compared to T-FSM

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

↑