Method for solving seed node with maximum influence based on mixture of hypergraph and common graph
The invention discloses a method for solving a maximum influence seed node based on the mixture of a hypergraph and a common graph, and provides an influence evaluation method based on the hypergraph, which is combined with an existing common bipartite graph influence evaluation method to obtain an...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Patent |
| Sprache: | chi ; eng |
| Schlagworte: | |
| 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 | WANG SHUAI LI JIE HE SHIYUN GUAN BEIBEI LEI RUOER |
| description | The invention discloses a method for solving a maximum influence seed node based on the mixture of a hypergraph and a common graph, and provides an influence evaluation method based on the hypergraph, which is combined with an existing common bipartite graph influence evaluation method to obtain an influence maximization method with better performance. According to the method, the seed node with the maximum influence can be solved from the hybrid network structure of the hypergraph and the common graph, and the method can be widely applied to the field of computer application.
本发明公开了一种基于超图和普通图混合求解最大影响力种子节点的方法，该方法提供了一种基于超图的影响力的评估方法，并与现有的普通二部图影响力评估方法结合，得到一种性能更优的影响力最大化的方法。通过本发明可以从超图和普通图的混合网络结构中求解最大影响力种子节点，可广泛应用于计算机应用领域。 |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN116894740A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN116894740A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN116894740A3</originalsourceid><addsrcrecordid>eNqNyksKwjAQgOFuXIh6h_EAgsXiYylFcaMr9yUmkyaQzIQ8tN7eIh7A1Q8_37SSV8yGFWiOkNg9LfWQEBUQK4SXzQa8GKwvHixpV5AkwkOkUTCBt0MuEYE1mHfA2EcRDAhSINn7EXzHvJpo4RIufp1Vy_Pp3l5WGLjDFIREwty1t7re7g_NrlkfN_-YD4iNPmU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method for solving seed node with maximum influence based on mixture of hypergraph and common graph</title><source>esp@cenet</source><creator>WANG SHUAI ; LI JIE ; HE SHIYUN ; GUAN BEIBEI ; LEI RUOER</creator><creatorcontrib>WANG SHUAI ; LI JIE ; HE SHIYUN ; GUAN BEIBEI ; LEI RUOER</creatorcontrib><description>The invention discloses a method for solving a maximum influence seed node based on the mixture of a hypergraph and a common graph, and provides an influence evaluation method based on the hypergraph, which is combined with an existing common bipartite graph influence evaluation method to obtain an influence maximization method with better performance. According to the method, the seed node with the maximum influence can be solved from the hybrid network structure of the hypergraph and the common graph, and the method can be widely applied to the field of computer application.
本发明公开了一种基于超图和普通图混合求解最大影响力种子节点的方法，该方法提供了一种基于超图的影响力的评估方法，并与现有的普通二部图影响力评估方法结合，得到一种性能更优的影响力最大化的方法。通过本发明可以从超图和普通图的混合网络结构中求解最大影响力种子节点，可广泛应用于计算机应用领域。</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2023</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&date=20231017&DB=EPODOC&CC=CN&NR=116894740A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76289</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231017&DB=EPODOC&CC=CN&NR=116894740A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>WANG SHUAI</creatorcontrib><creatorcontrib>LI JIE</creatorcontrib><creatorcontrib>HE SHIYUN</creatorcontrib><creatorcontrib>GUAN BEIBEI</creatorcontrib><creatorcontrib>LEI RUOER</creatorcontrib><title>Method for solving seed node with maximum influence based on mixture of hypergraph and common graph</title><description>The invention discloses a method for solving a maximum influence seed node based on the mixture of a hypergraph and a common graph, and provides an influence evaluation method based on the hypergraph, which is combined with an existing common bipartite graph influence evaluation method to obtain an influence maximization method with better performance. According to the method, the seed node with the maximum influence can be solved from the hybrid network structure of the hypergraph and the common graph, and the method can be widely applied to the field of computer application.
本发明公开了一种基于超图和普通图混合求解最大影响力种子节点的方法，该方法提供了一种基于超图的影响力的评估方法，并与现有的普通二部图影响力评估方法结合，得到一种性能更优的影响力最大化的方法。通过本发明可以从超图和普通图的混合网络结构中求解最大影响力种子节点，可广泛应用于计算机应用领域。</description><subject>CALCULATING</subject><subject>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNyksKwjAQgOFuXIh6h_EAgsXiYylFcaMr9yUmkyaQzIQ8tN7eIh7A1Q8_37SSV8yGFWiOkNg9LfWQEBUQK4SXzQa8GKwvHixpV5AkwkOkUTCBt0MuEYE1mHfA2EcRDAhSINn7EXzHvJpo4RIufp1Vy_Pp3l5WGLjDFIREwty1t7re7g_NrlkfN_-YD4iNPmU</recordid><startdate>20231017</startdate><enddate>20231017</enddate><creator>WANG SHUAI</creator><creator>LI JIE</creator><creator>HE SHIYUN</creator><creator>GUAN BEIBEI</creator><creator>LEI RUOER</creator><scope>EVB</scope></search><sort><creationdate>20231017</creationdate><title>Method for solving seed node with maximum influence based on mixture of hypergraph and common graph</title><author>WANG SHUAI ; LI JIE ; HE SHIYUN ; GUAN BEIBEI ; LEI RUOER</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN116894740A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>WANG SHUAI</creatorcontrib><creatorcontrib>LI JIE</creatorcontrib><creatorcontrib>HE SHIYUN</creatorcontrib><creatorcontrib>GUAN BEIBEI</creatorcontrib><creatorcontrib>LEI RUOER</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>WANG SHUAI</au><au>LI JIE</au><au>HE SHIYUN</au><au>GUAN BEIBEI</au><au>LEI RUOER</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method for solving seed node with maximum influence based on mixture of hypergraph and common graph</title><date>2023-10-17</date><risdate>2023</risdate><abstract>The invention discloses a method for solving a maximum influence seed node based on the mixture of a hypergraph and a common graph, and provides an influence evaluation method based on the hypergraph, which is combined with an existing common bipartite graph influence evaluation method to obtain an influence maximization method with better performance. According to the method, the seed node with the maximum influence can be solved from the hybrid network structure of the hypergraph and the common graph, and the method can be widely applied to the field of computer application.
本发明公开了一种基于超图和普通图混合求解最大影响力种子节点的方法，该方法提供了一种基于超图的影响力的评估方法，并与现有的普通二部图影响力评估方法结合，得到一种性能更优的影响力最大化的方法。通过本发明可以从超图和普通图的混合网络结构中求解最大影响力种子节点，可广泛应用于计算机应用领域。</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN116894740A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | Method for solving seed node with maximum influence based on mixture of hypergraph and common graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T01%3A52%3A16IST&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=WANG%20SHUAI&rft.date=2023-10-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN116894740A%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 |