返回
Efficient pattern matching for graphs with multi-Labeled nodes
DOI:10.1016/j.knosys.2016.07.009.png)
摘要
En 中文
Graph matching is important for a wide variety of applications in different domains such as social network analysis and knowledge discovery. Despite extensive research over the last few decades, graph matching is still challenging particularly when it comes with new conditions and constraints. In this paper, we focus on a new class of graph matching, in which each node can accept multiple labels instead of one. In particular, we address the problem of finding the top-k nodes of a data graph which best match a labeled query node from a given pattern graph. We firstly prove this to be an NP-Complete problem. Then, to address this issue and improve the scalability of our approach, we introduce a more flexible graph simulation, namely surjective simulation. This new graph simulation reduces the unnecessary complexity that is due to the unnecessary constraints imposed by the existing definitions while achieving high-quality matching results. In addition, our approach is associated with an early stop strategy to further boost the performance. To approximate the maximum size of a simulation, our approach utilizes Metropolis Hastings algorithm and ranks the top-k matches after computing the set of surjective simulations. The experimental results over social network graphs demonstrate the efficiency of the proposed approach and superiority over existing approaches. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Graph matching
Multi-labeled graph
Graph simulation
Metropolis hastings
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
The physiological effects of cigarette smoking: Implications for psychophysiological research吸烟的生理效应: 对心理生理学研究的启示
High channel count single-unit recordings from nonhuman primate frontal cortex来自非人类灵长类动物额叶皮层的高通道计数单单元记录

