属性图匹配的连续时间量子行走
A Continuous - Time Quantum Walk for Attributed Graphs Matching
摘要:
本文综述了图上量子游动理论的各个方面,特别是量子网络路由、量子游动搜索算法、图的特征值的元素区别性以及这些关系/联系在量子游动研究中的应用。不同的研究者都有自己的贡献,并提出了与这一研究理念相对应的基准思想。我还试图调查最近的应用量子行走,在具体的问题涉及到图匹配,即匹配节点(顶点)的图。在这篇研究论文中,我考虑了如何将连续时间量子行走(CTQW)用于图匹配问题。匹配问题是抽象的使用加权(属性)图,连接一个图的顶点到另一个,并试图计算距离b/n这些图节点的旁边,找到匹配的节点和匹配相关的成本。最后测量两个可能具有不同大小的图之间的距离,然后使用k-最近邻(k-NN)方法尝试基于特征空间中最接近的训练样本对这些图进行分类。
英文摘要:
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation /connection in the study of Quantum walks is furthermore described. Different Researchers had contribution and put their benchmark idea Pertaining with this research concept. I furthermore try to investigate recent Application of Quantum walks, In specific the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this research paper,I consider how Continuous-time quantum walk (CTQW) can be directed to Graph-matching problems. The matching problem is abstracted using weighted(attributed) Graphs that connects vertices's of one Graph to other and Try to compute the distance b/n those Graphs Node's Beside that finding the matched nodes and the Cost related to Matching. eventually measuring the distance between two Graphs which might have different size then by using k-nearest neighbor (k-NN) method try to classifying those graph based on closest training examples in the feature space.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。