.png){kind=icon}
返回
Mining frequent approximate patterns in large networks
.png){kind=icon}
OA
AI
DOI：10.1002/ima.22533.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Frequent pattern mining (FPM) algorithms are often based on graph isomorphism in order to identify common pattern occurrences. Recent research works, however, have focused on cases in which patterns can differ from their occurrences. Such cases have great potential for the analysis of noisy network data. Most existing FPM algorithms consider differences in edges and their labels, but none of them so far has considered the structural differences of vertices and their labels. Discerning how to identify cases that differ from the initial pattern by any number of vertices, edges, or labels has become the main challenge of recent research works. As a solution, we suggest a novel FMP algorithm named mining frequent approximate patterns (MFAPs) with two central new characteristics. First, we begin by using the inexact matching technique, which allows for structural differences in edge, vertices, and labels. Second, we follow the approximate matching with a focus on mining patterns within the directed graph, as opposed to the more commonly explored case of patterns being mined from the undirected graph. Our results illustrate the effectiveness of this new MFAP algorithm in identifying patterns within an optimized time.
Keyword:
approximate matching
direct graph
frequent pattern mining
JSON noisy data
networks
undirected graph
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
2.2K
被引数:
2.3K
机构
引用论文
.png){kind=icon}
分享收藏A(H3N2) antigenic variation of influenza is associated with low vaccine efficacy in the early 2018 influenza season in Mexico CityA(H3N2)流感抗原变异与墨西哥城2018年初流感季节疫苗低效有关OAAI
OAAI分享收藏分享收藏
查看更多内容