.png){kind=icon}
返回
Propagation kernels: efficient graph kernels from propagated information
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-015-5517-9.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce propagation kernels, a general graph-kernel framework for efficiently measuring the similarity of structured data. Propagation kernels are based on monitoring how information spreads through a set of given graphs. They leverage early-stage distributions from propagation schemes such as random walks to capture structural information encoded in node labels, attributes, and edge information. This has two benefits. First, off-the-shelf propagation schemes can be used to naturally construct kernels for many graph types, including labeled, partially labeled, unlabeled, directed, and attributed graphs. Second, by leveraging existing efficient and informative propagation schemes, propagation kernels can be considerably faster than state-of-the-art approaches without sacrificing predictive performance. We will also show that if the graphs at hand have a regular structure, for instance when modeling image or video data, one can exploit this regularity to scale the kernel computation to large databases of graphs with thousands of nodes. We support our contributions by exhaustive experiments on a number of real-world graphs from a variety of application domains.
Keyword:
Learning with graphs
Graph kernels
Random walks
Locality sensitive hashing
Convolutions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
Nanocrystalline silicon films as multifunctional material for optoelectronic and photovoltaic applications纳米硅薄膜作为光电和光伏应用的多功能材料
PREAI
分享收藏Assessment of Low-Temperature Cracking in Asphalt Materials Using an Acoustic Emission Approach
PREAI
分享收藏Effect of Glutathione Depletion on Haemoglobin and Membrane Integrity of Red Blood Cells of Rats
PREAI
分享收藏
查看更多内容