K2-MDD-based maximum common sub-graph matching method with labeled graph

K2-MDD-based maximum common sub-graph matching method with labeled graph

The invention discloses a k2-MDD-based maximum common sub-graph matching method with a labeled graph. The method comprises the steps of screening vertex labels of a matching graph, selecting vertexessame as a target graph labeled in the matching graph, and changing labels of the vertexes into labels...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: GUAN SHANWEN, LUO LIGENG, ZHU YIJIE, LENG BEIBEI, SHEN XINTONG
Format: Patent
Sprache:chi ; eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator GUAN SHANWEN
LUO LIGENG
ZHU YIJIE
LENG BEIBEI
SHEN XINTONG
description The invention discloses a k2-MDD-based maximum common sub-graph matching method with a labeled graph. The method comprises the steps of screening vertex labels of a matching graph, selecting vertexessame as a target graph labeled in the matching graph, and changing labels of the vertexes into labels of the vertexes corresponding to the vertexes in the target graph to obtain a new matching graph;encoding the vertexes of the target graph and the new matching graph according to the rule of the k2 tree; encoding the edges of the target graph and the new matching graph according to the vertex codes of the target graph and the new matching graph; constructing a multi-valued decision graph structure according to the codes of the edges of the target graph and the new matching graph to obtain k2-MDD structure graphs of the target graph and the new matching graph; and in the constructed k2-MDD structure graphs of the target graph and the matching graph, solving the maximum common sub-graph ofthe target graph and the ma
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN111597404A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN111597404A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN111597404A3</originalsourceid><addsrcrecordid>eNrjZPDwNtL1dXHRTUosTk1RyE2syMwtzVVIzs_Nzc9TKC5N0k0vSizIAEqUJGdk5qUr5KaWZOSnKJRnlmQo5CQmpeYAdYGV8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0NDU0tzEwMTR2Ni1AAADmQzTQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>K2-MDD-based maximum common sub-graph matching method with labeled graph</title><source>esp@cenet</source><creator>GUAN SHANWEN ; LUO LIGENG ; ZHU YIJIE ; LENG BEIBEI ; SHEN XINTONG</creator><creatorcontrib>GUAN SHANWEN ; LUO LIGENG ; ZHU YIJIE ; LENG BEIBEI ; SHEN XINTONG</creatorcontrib><description>The invention discloses a k2-MDD-based maximum common sub-graph matching method with a labeled graph. The method comprises the steps of screening vertex labels of a matching graph, selecting vertexessame as a target graph labeled in the matching graph, and changing labels of the vertexes into labels of the vertexes corresponding to the vertexes in the target graph to obtain a new matching graph;encoding the vertexes of the target graph and the new matching graph according to the rule of the k2 tree; encoding the edges of the target graph and the new matching graph according to the vertex codes of the target graph and the new matching graph; constructing a multi-valued decision graph structure according to the codes of the edges of the target graph and the new matching graph to obtain k2-MDD structure graphs of the target graph and the new matching graph; and in the constructed k2-MDD structure graphs of the target graph and the matching graph, solving the maximum common sub-graph ofthe target graph and the ma</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2020</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200828&amp;DB=EPODOC&amp;CC=CN&amp;NR=111597404A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20200828&amp;DB=EPODOC&amp;CC=CN&amp;NR=111597404A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GUAN SHANWEN</creatorcontrib><creatorcontrib>LUO LIGENG</creatorcontrib><creatorcontrib>ZHU YIJIE</creatorcontrib><creatorcontrib>LENG BEIBEI</creatorcontrib><creatorcontrib>SHEN XINTONG</creatorcontrib><title>K2-MDD-based maximum common sub-graph matching method with labeled graph</title><description>The invention discloses a k2-MDD-based maximum common sub-graph matching method with a labeled graph. The method comprises the steps of screening vertex labels of a matching graph, selecting vertexessame as a target graph labeled in the matching graph, and changing labels of the vertexes into labels of the vertexes corresponding to the vertexes in the target graph to obtain a new matching graph;encoding the vertexes of the target graph and the new matching graph according to the rule of the k2 tree; encoding the edges of the target graph and the new matching graph according to the vertex codes of the target graph and the new matching graph; constructing a multi-valued decision graph structure according to the codes of the edges of the target graph and the new matching graph to obtain k2-MDD structure graphs of the target graph and the new matching graph; and in the constructed k2-MDD structure graphs of the target graph and the matching graph, solving the maximum common sub-graph ofthe target graph and the ma</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2020</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPDwNtL1dXHRTUosTk1RyE2syMwtzVVIzs_Nzc9TKC5N0k0vSizIAEqUJGdk5qUr5KaWZOSnKJRnlmQo5CQmpeYAdYGV8DCwpiXmFKfyQmluBkU31xBnD93Ugvz41OKCxOTUvNSSeGc_Q0NDU0tzEwMTR2Ni1AAADmQzTQ</recordid><startdate>20200828</startdate><enddate>20200828</enddate><creator>GUAN SHANWEN</creator><creator>LUO LIGENG</creator><creator>ZHU YIJIE</creator><creator>LENG BEIBEI</creator><creator>SHEN XINTONG</creator><scope>EVB</scope></search><sort><creationdate>20200828</creationdate><title>K2-MDD-based maximum common sub-graph matching method with labeled graph</title><author>GUAN SHANWEN ; LUO LIGENG ; ZHU YIJIE ; LENG BEIBEI ; SHEN XINTONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN111597404A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2020</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>GUAN SHANWEN</creatorcontrib><creatorcontrib>LUO LIGENG</creatorcontrib><creatorcontrib>ZHU YIJIE</creatorcontrib><creatorcontrib>LENG BEIBEI</creatorcontrib><creatorcontrib>SHEN XINTONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GUAN SHANWEN</au><au>LUO LIGENG</au><au>ZHU YIJIE</au><au>LENG BEIBEI</au><au>SHEN XINTONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>K2-MDD-based maximum common sub-graph matching method with labeled graph</title><date>2020-08-28</date><risdate>2020</risdate><abstract>The invention discloses a k2-MDD-based maximum common sub-graph matching method with a labeled graph. The method comprises the steps of screening vertex labels of a matching graph, selecting vertexessame as a target graph labeled in the matching graph, and changing labels of the vertexes into labels of the vertexes corresponding to the vertexes in the target graph to obtain a new matching graph;encoding the vertexes of the target graph and the new matching graph according to the rule of the k2 tree; encoding the edges of the target graph and the new matching graph according to the vertex codes of the target graph and the new matching graph; constructing a multi-valued decision graph structure according to the codes of the edges of the target graph and the new matching graph to obtain k2-MDD structure graphs of the target graph and the new matching graph; and in the constructed k2-MDD structure graphs of the target graph and the matching graph, solving the maximum common sub-graph ofthe target graph and the ma</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language chi ; eng
recordid cdi_epo_espacenet_CN111597404A
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title K2-MDD-based maximum common sub-graph matching method with labeled graph
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T15%3A33%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=GUAN%20SHANWEN&rft.date=2020-08-28&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN111597404A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true