资源分类
》 资源 》论文》A Similarity Measurement Method Based on Graph Kernel for Disconnected Graphs

A Similarity Measurement Method Based on Graph Kernel for Disconnected Graphs

2019-10-11 | |  48 |   30 |   0
Abstract Disconnected graphs are very common in the real world. However, most existing methods for graph similarity focus on connected graph. In this paper, we propose an effective approach for measuring the similarity of disconnected graphs. By embedding connected subgraphs with graph kernel, we obtain the feature vectors in low dimensional space. Then, we match the subgraphs and weigh the similarity of matched subgraphs. Finally, an intuitive example shows the feasibility of the method

上一篇：A Dual Approach to Verify and Train Deep Networks?

下一篇：Addressing Age-Related Bias in Sentiment Analysis ?

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...