{"id":316,"date":"2011-12-23T23:42:04","date_gmt":"2011-12-23T15:42:04","guid":{"rendered":"http:\/\/ykyi.net\/?p=316"},"modified":"2011-12-23T23:42:04","modified_gmt":"2011-12-23T15:42:04","slug":"%e5%90%ac%e4%ba%86%e6%9e%97%e5%ad%a6%e6%b0%91%e6%95%99%e6%8e%88%e7%9a%84%e4%b8%80%e4%b8%aa%e5%ad%a6%e6%9c%af%e6%8a%a5%e5%91%8a","status":"publish","type":"post","link":"https:\/\/ykyi.net\/?p=316","title":{"rendered":"\u542c\u4e86\u6797\u5b66\u6c11\u6559\u6388\u7684\u4e00\u4e2a\u5b66\u672f\u62a5\u544a"},"content":{"rendered":"
\n

                  Graph-based Structure Search<\/strong><\/p>\n

\u6797\u5b66\u6c11\u6559\u6388\u662f\u6570\u636e\u5e93\u7406\u8bba\u65b9\u9762\u7684\u4e13\u5bb6\u3002\u4eca\u5929\u7684\u5b66\u672f\u62a5\u544a\uff0c\u6797\u6559\u6388\u7ed9\u6211\u4eec\u7b80\u5355\u4ecb\u7ecd\u4e86\u4ed6\u7684\u7814\u7a76\u56e2\u961f\u5728\u6d77\u91cf\u6570\u636e\u68c0\u7d22\u65b9\u9762\u7684\u7814\u7a76\u6210\u679c\u3002<\/p>\n

\u5728\u5feb\u5e26\u53d1\u5c55\u7684\u4e92\u8054\u7f51\u793e\u4f1a\uff0c\u8d8a\u6765\u8d8a\u591a\u7684\u5e94\u7528\u9700\u8981\u68c0\u7d22\u5feb\u901f\u5730\u68c0\u7d22\u57fa\u4e8e\u56fe\u7ed3\u6784\u7684\u6d77\u91cf\u6570\u636e\u3002\u6bd4\u5982\u8fd1\u4e24\u4e09\u5e74\u5174\u8d77\u7684\uff0c\u6211\u4eec\u975e\u5e38\u719f\u6089\u7684\u793e\u4ea4\u7f51\u7edc\u3002\u5bf9\u4e8e\u56fe\u7684\u7ed3\u6784\u5316\u68c0\u7d22\u662f\u4e00\u4e2aNPC<\/span>\u95ee\u9898\u3002\u6d77\u91cf\u7684\u6570\u636e\u89c4\u6a21\u4f7f\u5f97\u95ee\u9898\u53d8\u5f97\u975e\u5e38\u7684\u68d8\u624b\u3002\u6211\u641c\u7d22\u4e86\u4e00\u4e9b\u8d44\u6599\u4e5f\u6ca1\u641e\u6e05\u695a\u4ec0\u4e48\u53eb<\/span>NPC<\/span>\u95ee\u9898\u3002\u6211\u7b80\u5355\u5730\u7406\u89e3\uff0c\u662f\u5f53\u95ee\u9898\u7684\u89c4\u6a21\u53d8\u5f97\u8d8a\u6765\u8d8a\u5927\u65f6\uff0c\u5c31\u4e0d\u80fd\u786e\u5b9a\u662f\u5426\u80fd\u5728\u786e\u5b9a\u7684\u65f6\u95f4\u5185\u6c42\u51fa\u89e3\u3002<\/span><\/p>\n

\u6797\u6559\u6388\u5148\u7b80\u5355\u5730\u63d0\u5230\u5bf9\u56fe\u7684\u7814\u7a76\u65b9\u5411\u5927\u81f4\u5206Mining Graphs,<\/span>\u548c<\/span>Quering Graphs<\/span>\u3002<\/span>Mining Graphs<\/span>\u65b9\u9762\u6709<\/span>Frequent Patterns, structure Similarityies, clustering, Ranking, classification<\/span>\u3002<\/span>Prof. Lin<\/span>\u7684\u56e2\u961f\u4e3b\u8981\u505a\u4e86<\/span>Structure Similarities<\/span>\u65b9\u9762\u7684\u4e00\u4e9b\u7814\u7a76\u3002\u5bf9\u4e8e<\/span>Querying Graphs<\/span>\uff0c\u53c8\u5927\u81f4\u5206\u4e3a<\/span>Readibility, Connectivity between two nodes, substructure search, shortest paths, strings<\/span>\u3002<\/span>Prof. Lin<\/span>\u8bdd\uff1a\u5bf9\u4e8e<\/span>shortest path<\/span>\uff0c\u7406\u8bba\u4e0a\u6c42\u89e3\u5f88<\/span>simple<\/span>\uff0c\u4f46\u662f\u5e94\u7528\u5230\u5927\u91cf\u6570\u636e\u7684\u65f6\u5019\uff0c\u5c31\u8981\u505a\u5f88\u591a\u5de5\u4f5c\u3002\u6bd4\u5982\u8981\u505a\u975e\u5e38\u9ad8\u6548\u7684\u7d22\u5f15\u3002\u5bf9\u4e8e<\/span>strings<\/span>\uff0c\u4e00\u4e2a\u5f88\u957f\u7684<\/span>text<\/span>\u53ef\u4ee5\u770b\u6210\u4e00\u4e2a\u957f<\/span>string<\/span>\u3002\u6bd4\u4e8e\u73b0\u5728\u7684<\/span>internet<\/span>\u641c\u7d22\u5f15\u64ce\uff0c\u8981\u89e3\u51b3\u533a\u5206\u4e92\u8054\u7f51\u4e0a\u592a\u591a\u5197\u4f59\u6570\u636e\u7684\u95ee\u9898\uff0c\u5c31\u5c5e\u4e8e\u8fd9\u65b9\u9762\u7684\u7814\u7a76\u3002\u6211\u77e5\u9053\u641c\u7d22\u5f15\u64ce\u662f\u9f13\u52b1\u539f\u521b\u7684\uff0c\u4f1a\u7ed9\u539f\u521b\u7684\u9875\u9762\u6bd4\u8f83\u9ad8\u7684<\/span>page rank<\/span>\u3002\u9488\u5bf9\u8fd9\u70b9\uff0c<\/span>black hat SEO<\/span>\u5c31\u4f1a\u641e\u4f2a\u539f\u521b\uff0c\u600e\u6837\u8ba9\u641c\u7d22\u5f15\u64ce\u5feb\u901f\u533a\u5206\u51fa\u771f\u6b63\u7684\u539f\u521b\u5185\u5bb9\u5462\uff1f\u5e94\u8be5\u4e5f\u5c5e\u4e8e\u8fd9\u65b9\u9762\u7684\u8bfe\u9898\u5427\u3002<\/span><\/p>\n

\u6797\u6559\u6388\u5f00\u59cb\u8bb2\u4ed6\u7684\u79d1\u7814\u56e2\u961f\u7684\u7b2c\u4e00\u4e2a\u8d21\u732e\u3002\u8fd9\u4e2acontribution<\/span>\u662f\u89e3\u51b3\u4e86\u5173\u4e8e\u56fe\u4e0e\u56fe\u4e4b\u95f4\u5305\u542b\u7684\u95ee\u9898\u3002\u95ee\u9898\u63cf\u8ff0\u4e3a\uff1a\u7ed9\u51fa\u4e00\u4e2a<\/span>Data Graph<\/span>\u548c\u4e00\u4e2a<\/span>Query Graph<\/span>\uff0c\u8981\u5728\u4e00\u4e2a\u89c4\u6a21\u975e\u5e38\u5927\u7684<\/span>Data Graph<\/span>\u91cc\u9762\u627e\u5230\u8fd9\u4e2a<\/span>Query Graph<\/span>\u3002\u6797\u6559\u6388\u4ecb\u7ecd\u4e86\u8fd9\u4e2a\u8fc7\u7a0b\u4e2d\u7684<\/span>Filtering<\/span>\u548c<\/span>Verification<\/span>\u7b97\u6cd5\u7b80\u8981\u601d\u8def\u3002\u5bf9\u4e8e\u4e0d\u61c2\u5b66\u672f\u7684\u6211\uff0c\u8fd9\u90e8\u5206\u771f\u662f\u76f8\u5f53\u5730\u96be\u4ee5\u7406\u89e3\u554a\uff01\uff01\uff01\u8bbe<\/span>D<\/span>\u662f\u8981\u5904\u7406\u7684\u56fe\u3002<\/span>First index a set F of features from D<\/span>\u3002\u5bf9\u4e8e\u4efb\u610f<\/span>f<\/span>\u5c5e\u4e8e<\/span>F, <\/span>\u6c42<\/span>f<\/span>\u7684\u8d85\u56fe\u3002\u7d22\u5f15\u7684\u7b97\u6cd5\u601d\u8def\u662f\u3002\u5982\u679c<\/span>q<\/span>\u662f\u4e00\u4e2a<\/span>frequent subgraph,<\/span>\u5219 <\/span>1. <\/span>\u5982\u679c<\/span>q<\/span>\u5df2\u7ecf\u88ab\u7d22\u5f15\uff0c\u5219\u8fd4\u56de<\/span>q<\/span>\u7684\u8d85\u56fe\u3002<\/span>2.<\/span>\u5982\u679c<\/span>q<\/span>\u662f\u4e00\u4e2a\u8d85\u56fe\uff0c\u6b21<\/span>q<\/span>\u88ab\u7d22\u5f15\u4e86\uff0c\u4e0d\u9700\u8981\u7ed9\u6b21<\/span>q<\/span>\u7684\u8d85\u56fe\u505a<\/span>verification<\/span>\u3002\u5982\u679c<\/span>q<\/span>\u4e0d\u662f\u4e00\u4e2a<\/span>frequent subgraph<\/span>\u7684\u60c5\u51b5\u4e0b\uff0c\u9a8c\u8bc1\u53d7\u5236\u4e8e<\/span>sigmal|D|<\/span>\u3002\u6797\u6559\u6388\u8ba4\u4e3a\u8fd9\u4e2a\u6c42\u89e3\u8fc7\u7a0b\u7684\u4e3b\u8981\u5f00\u9500\u5728<\/span>verification<\/span>\u9636\u6bb5\u3002\u4ed6\u4eec\u7684\u56e2\u961f\u5c31\u662f\u628a\u8fd9\u4e2a<\/span>cost<\/span>\u663e\u8457\u964d\u4e86\u4e00\u4e0b\uff0c\u800c\u4e14\u601d\u8def\u975e\u5e38\u5730<\/span>clear<\/span>\u548c<\/span>simple<\/span>\u3002\u4ed6\u603b\u7ed3\u4e86\u4e09\u6761\u7ecf\u9a8c\uff1a <\/span>1. Access infrequent labels as early as possible. 2. Retain connectivity<\/span>\u3002 <\/span>3. Effectively use degree information.<\/span><\/p>\n

The second contribution of Prof. Lin is to put the the theoretic algorithm into practice.\u6709\u4e24\u4e2a\u95ee\u9898\uff0c\u4e00\u4e2a\u662f<\/span>query graph<\/span>\u88ab<\/span>data graph<\/span>\u5305\u542b<\/span>(contained)<\/span>\uff0c\u53e6\u4e00\u4e2a\u662f<\/span>query graph<\/span>\u5305\u542b\u4e86<\/span>data graph.<\/span>\u6797\u6559\u6388\u7684\u56e2\u961f\u7684\u6700\u7ed3\u6210\u679c\u6bd4\u5df2\u7ecf\u53d1\u8868\u4e86\u8bba\u6587\u7684\u53e6\u4e00\u4e2a\u79d1\u7814\u56e2\u961f\u7684\u6210\u679c\u7684\u901f\u5ea6\u8981\u5feb\u4e86\u4e00\u4e2a\u6570\u91cf\u7ea7\u3002<\/span>Prof. Lin<\/span>\u7684\u8bed\u6c14\u663e\u5f97\u6709\u4e9b\u9057\u61be\uff0c\u4ed6\u4eec\u7684\u601d\u8def\u662f\u6b63\u786e\u7684\uff0c\u5b9e\u73b0\u7684\u6548\u7387\u4e5f\u5f88\u9ad8\uff0c\u4f46\u662f\u65f6\u95f4\u4e0a\u6162\u4e86\u5c0f\u5c0f\u3002<\/span><\/p>\n

http:\/\/ykyi.net<\/a> zausiu's blog<\/p>\n

\u53d1\u8a00\u961f\u6bb5\uff0c\u7814\u7a76\u8fd9\u4e2a\u65b9\u5411\u7684\u7518\u540c\u5b66\u95ee\u4e86\u975e\u5e38\u4e13\u4e1a\u7684\u95ee\u9898\uff0c\u6211\u4e0d\u61c2\u554a\uff01\u8fd8\u6709\u4e00\u4f4d\u4fe1\u79d1\u9662\u7684\u7814\u4e00\u540c\u5b66\u95ee\u5230\u4e86\u7559\u5b66\u7684\u95ee\u9898\uff0cProf. Lin<\/span>\u8bf4\u4ed6\u8981\u6700<\/span>top<\/span>\u7684\u5b66\u751f\uff0c\u975e\u5e38\u5730<\/span>talented<\/span>\uff0c\u975e\u5e38\u5730<\/span>diligent, <\/span>\u975e\u5e38\u5730<\/span>good at algorithm<\/span>\uff0c\u8fd8\u8981\u6709\u975e\u5e38\u597d\u7684<\/span>practical ability<\/span>\u3002\u671d\u7ea2\u9633\u6559\u6388\u5411\u6797\u6559\u6388\u6253\u542c\u6709\u6ca1\u6709\u505a\u56fe\u8c61<\/span>search<\/span>\u65b9\u9762\u7684\u5927\u725b\u3002<\/span><\/p>\n

\u5b66\u672f\u62a5\u544a\u597d\u96be\u554a\uff01\u6211\u60f3\u542c\u5de5\u7a0b\u7c7b\u7684\u62a5\u544a\u3002\u4f46\u90fd\u662facademic report<\/span>\u554a\uff01<\/span><\/p>\n

\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/<\/p>\n

Topic: <\/strong><\/p>\n

Graph-based Structure Search<\/p>\n

 <\/p>\n

Speaker:<\/strong><\/p>\n

Prof. Xuemin Lin<\/p>\n

School of Computer Science and Enmgineering,University of New South Wales<\/p>\n

and<\/p>\n

School of Software ,Eastern China Normal University<\/p>\n

 <\/p>\n

Abstract:<\/strong><\/p>\n

Recent years have witnessed an emergence of graph-based applications that strongly demand efficient processing of graph-based queries and searches.<\/p>\n

In many real applications such as chem- and  bio-informatics, road neworks, social networks, etc.,  efficiently and effectively conducting structure search on graphs is a key.<\/p>\n

The problem of structure search on graphs and its variants are NP-complete. The presence of a large number of graphs makes the problem computationally more intractable.<\/p>\n

In this talk, I will introduce recent techniques in graph structure search with the focus on our recent work published in SIGMOD, VLDB, ICDE, etc. My talk will cover the problems of substructure search, superstructure search, and substructure similarity search.<\/p>\n

 <\/p>\n

Brief Bio:<\/strong><\/p>\n

\u6797\u5b66\u6c11\uff0c\u65b0\u5357\u5a01\u5c14\u58eb\u5927\u5b66\u5927\u5b66\u8ba1\u7b97\u673a\u79d1\u5b66\u53ca\u5de5\u7a0b\u5b66\u9662\u6559\u6388\uff0c\u6570\u636e\u5e93\u7814\u7a76\u5b9e\u9a8c\u5ba4\u4e3b\u4efb\u3002\u81ea2009\u5e744\u6708\u8d77\uff0c\u5728\u534e\u4e1c\u5e08\u8303\u5927\u5b66\u62c5\u4efb\u517c\u804c\u6559\u6388\uff0c2010\u5e74\u5165\u9009\u56fd\u5bb6\u7b2c\u56db\u6279\u5343\u4eba\u8ba1\u5212\u5b66\u8005\uff0c2011\u5e746\u6708\u8d77\u53d7\u8058\u4e8e\u534e\u4e1c\u5e08\u8303\u5927\u5b66\u8f6f\u4ef6\u5b66\u9662\u5343\u4eba\u5b66\u8005\u3002\u751f\u4e8e\u4e0a\u6d77\u5e02\uff0c1984\u5e74\u6bd5\u4e1a\u4e8e\u590d\u65e6\u5927\u5b66\u6570\u5b66\u7cfb\uff0c1992\u5e74\u5728\u6606\u58eb\u5170\u5927\u5b66\u83b7\u5f97\u535a\u58eb\u5b66\u4f4d\u3002\u957f\u671f\u4ece\u4e8b\u6570\u636e\u5e93\u7406\u8bba\u3001\u7b97\u6cd5\u4e0e\u6280\u672f\u7814\u7a76\uff0c\u5305\u62ec\u7a7a\u95f4\u6570\u636e\u3001\u4e0d\u786e\u5b9a\u6570\u636e\u3001\u6d41\u6570\u636e\u3001\u56fe\u6570\u636e\u7b49\u9886\u57df\u3002\u8fd1\u5e74\u6765\u5728\u6570\u636e\u5e93\u9886\u57df\u9876\u7ea7\u56fd\u9645\u5b66\u672f\u4f1a\u8bae\u53ca\u9876\u7ea7\u6742\u5fd7\u4e0a\u5171\u53d1\u8868\u4e8670\u4f59\u7bc7\u5b66\u672f\u8bba\u6587\uff1b\u7d2f\u8ba1\u5728\u6570\u636e\u5e93\u548c\u7b97\u6cd5\u9886\u57df\u91cd\u8981\u7684\u56fd\u9645\u5b66\u672f\u4f1a\u8bae\u548c\u56fd\u9645\u5b66\u672f\u671f\u520a\u53d1\u8868\u5e76\u5f55\u7528\u4e86170\u4f59\u7bc7\u8bba\u6587\uff0c\u5176\u4e2d10\u7bc7\u56fd\u9645\u4f1a\u8bae\u4f18\u79c0\u8bba\u6587\uff0c\u5305\u62ecICDE'07\u4e0a\u7684\u4f18\u79c0\u5b66\u751f\u8bba\u6587\u5956 (best student paper award) ICDE'10\u4e0a\u7684\u4f18\u79c0\u8bba\u6587(one of the best papers) , \u53caSIGMOD'11 \u4e0a\u7684\u4f18\u79c0\u8bba\u6587(one of the best papers)\u3002\u4ed6\u76ee\u524d\u7684\u7814\u7a76\u5174\u8da3\u662f\u6d77\u91cf\u6570\u636e\u7684\u5904\u7406\uff0c\u5305\u62ec\u56fe\u6570\u636e\u3001\u65f6\u7a7a\u6570\u636e\u3001\u5b57\u7b26\u4e32\u6570\u636e\u3001\u4e0d\u786e\u5b9a\u6570\u636e\u7b49\u3002\u5b66\u6c11\u5148\u540e\u57284th Australasian Theory Symposium (CATS'98), 6th International Computing and Combintorics Conference (COCOON2000), 6th Asia Pacific Web Conference (APweb04), the joint conference of 9th Asia Web Conference and 8th Web-Age Information Management Conference (APweb\/WAIM2007), \u548c 19th and 20th Australasian Database Conference (ADC08, ADC09) \u62c5\u4efb\u4f1a\u8bae\u7a0b\u5e8f\u59d4\u5458\u4f1a\u4e3b\u5e2d\uff0c\u572814th International Conference on Database Systems for Advanced Applications (DASFAA09) \u4e0a\u62c5\u4efb\u5927\u4f1a\u4e3b\u5e2d\u3002\u76ee\u524d\u4ed6\u662fACM TODS\u7684\u7f16\u59d4\u3002<\/p>\n

 <\/p>\n

Presided by  <\/strong><\/p>\n

Prof. Jianlin Feng<\/p>\n

 <\/p>\n

Date and Venue<\/strong><\/p>\n

Dec 21, 2011(Wed.) 14\uff1a00-15\uff1a00<\/p>\n

Lecture Theater A101, School of Software, Sun Yat-sen University<\/p>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

                  Graph-based Structure Search \u6797\u5b66\u6c11\u6559\u6388\u662f\u6570\u636e\u5e93\u7406\u8bba\u65b9\u9762\u7684\u4e13\u5bb6\u3002\u4eca\u5929\u7684\u5b66\u672f\u62a5\u544a\uff0c\u6797\u6559\u6388\u7ed9\u6211\u4eec\u7b80\u5355\u4ecb\u7ecd\u4e86\u4ed6\u7684\u7814\u7a76\u56e2\u961f\u5728\u6d77\u91cf\u6570\u636e\u68c0\u7d22\u65b9\u9762\u7684\u7814\u7a76\u6210\u679c\u3002 \u5728\u5feb\u5e26\u53d1\u5c55\u7684\u4e92\u8054\u7f51\u793e\u4f1a\uff0c\u8d8a\u6765\u8d8a\u591a\u7684\u5e94\u7528\u9700\u8981\u68c0\u7d22\u5feb\u901f\u5730\u68c0\u7d22\u57fa\u4e8e\u56fe\u7ed3\u6784\u7684\u6d77\u91cf\u6570\u636e\u3002\u6bd4\u5982\u8fd1\u4e24\u4e09\u5e74\u5174\u8d77\u7684\uff0c\u6211\u4eec\u975e\u5e38\u719f\u6089\u7684\u793e\u4ea4\u7f51\u7edc\u3002\u5bf9\u4e8e\u56fe\u7684\u7ed3\u6784\u5316\u68c0\u7d22\u662f\u4e00\u4e2aNPC\u95ee\u9898\u3002\u6d77\u91cf\u7684\u6570\u636e\u89c4\u6a21\u4f7f\u5f97\u95ee\u9898\u53d8\u5f97\u975e\u5e38\u7684\u68d8\u624b\u3002\u6211\u641c\u7d22\u4e86\u4e00\u4e9b\u8d44\u6599\u4e5f\u6ca1\u641e\u6e05\u695a\u4ec0\u4e48\u53ebNPC\u95ee\u9898\u3002\u6211\u7b80\u5355\u5730\u7406\u89e3\uff0c\u662f\u5f53\u95ee\u9898\u7684\u89c4\u6a21\u53d8\u5f97\u8d8a\u6765\u8d8a\u5927\u65f6\uff0c\u5c31\u4e0d\u80fd\u786e\u5b9a\u662f\u5426\u80fd\u5728\u786e\u5b9a\u7684\u65f6\u95f4\u5185\u6c42\u51fa\u89e3\u3002 \u6797\u6559\u6388\u5148\u7b80\u5355\u5730\u63d0\u5230\u5bf9\u56fe\u7684\u7814\u7a76\u65b9\u5411\u5927\u81f4\u5206Mining Graphs,\u548cQuering Graphs\u3002Mining Graphs\u65b9\u9762\u6709Frequent Patterns, structure Similarityies, clustering, Ranking, classification\u3002Prof. Lin\u7684\u56e2\u961f\u4e3b\u8981\u505a\u4e86Structure Similarities\u65b9\u9762\u7684\u4e00\u4e9b\u7814\u7a76\u3002\u5bf9\u4e8eQuerying Graphs\uff0c\u53c8\u5927\u81f4\u5206\u4e3aReadibility, Connectivity between two nodes, substructure search, shortest paths, strings\u3002Prof. Lin\u8bdd\uff1a\u5bf9\u4e8eshortest path\uff0c\u7406\u8bba\u4e0a\u6c42\u89e3\u5f88simple\uff0c\u4f46\u662f\u5e94\u7528\u5230\u5927\u91cf\u6570\u636e\u7684\u65f6\u5019\uff0c\u5c31\u8981\u505a\u5f88\u591a\u5de5\u4f5c\u3002\u6bd4\u5982\u8981\u505a\u975e\u5e38\u9ad8\u6548\u7684\u7d22\u5f15\u3002\u5bf9\u4e8estrings\uff0c\u4e00\u4e2a\u5f88\u957f\u7684text\u53ef\u4ee5\u770b\u6210\u4e00\u4e2a\u957fstring\u3002\u6bd4\u4e8e\u73b0\u5728\u7684internet\u641c\u7d22\u5f15\u64ce\uff0c\u8981\u89e3\u51b3\u533a\u5206\u4e92\u8054\u7f51\u4e0a\u592a\u591a\u5197\u4f59\u6570\u636e\u7684\u95ee\u9898\uff0c\u5c31\u5c5e\u4e8e\u8fd9\u65b9\u9762\u7684\u7814\u7a76\u3002\u6211\u77e5\u9053\u641c\u7d22\u5f15\u64ce\u662f\u9f13\u52b1\u539f\u521b\u7684\uff0c\u4f1a\u7ed9\u539f\u521b\u7684\u9875\u9762\u6bd4\u8f83\u9ad8\u7684page rank\u3002\u9488\u5bf9\u8fd9\u70b9\uff0cblack hat SEO\u5c31\u4f1a\u641e\u4f2a\u539f\u521b\uff0c\u600e\u6837\u8ba9\u641c\u7d22\u5f15\u64ce\u5feb\u901f\u533a\u5206\u51fa\u771f\u6b63\u7684\u539f\u521b\u5185\u5bb9\u5462\uff1f\u5e94\u8be5\u4e5f\u5c5e\u4e8e\u8fd9\u65b9\u9762\u7684\u8bfe\u9898\u5427\u3002 \u6797\u6559\u6388\u5f00\u59cb\u8bb2\u4ed6\u7684\u79d1\u7814\u56e2\u961f\u7684\u7b2c\u4e00\u4e2a\u8d21\u732e\u3002\u8fd9\u4e2acontribution\u662f\u89e3\u51b3\u4e86\u5173\u4e8e\u56fe\u4e0e\u56fe\u4e4b\u95f4\u5305\u542b\u7684\u95ee\u9898\u3002\u95ee\u9898\u63cf\u8ff0\u4e3a\uff1a\u7ed9\u51fa\u4e00\u4e2aData Graph\u548c\u4e00\u4e2aQuery Graph\uff0c\u8981\u5728\u4e00\u4e2a\u89c4\u6a21\u975e\u5e38\u5927\u7684Data Graph\u91cc\u9762\u627e\u5230\u8fd9\u4e2aQuery Graph\u3002\u6797\u6559\u6388\u4ecb\u7ecd\u4e86\u8fd9\u4e2a\u8fc7\u7a0b\u4e2d\u7684Filtering\u548cVerification\u7b97\u6cd5\u7b80\u8981\u601d\u8def\u3002\u5bf9\u4e8e\u4e0d\u61c2\u5b66\u672f\u7684\u6211\uff0c\u8fd9\u90e8\u5206\u771f\u662f\u76f8\u5f53\u5730\u96be\u4ee5\u7406\u89e3\u554a\uff01\uff01\uff01\u8bbeD\u662f\u8981\u5904\u7406\u7684\u56fe\u3002First index a set F of features from D\u3002\u5bf9\u4e8e\u4efb\u610ff\u5c5e\u4e8eF, \u6c42f\u7684\u8d85\u56fe\u3002\u7d22\u5f15\u7684\u7b97\u6cd5\u601d\u8def\u662f\u3002\u5982\u679cq\u662f\u4e00\u4e2afrequent subgraph,\u5219 1. \u5982\u679cq\u5df2\u7ecf\u88ab\u7d22\u5f15\uff0c\u5219\u8fd4\u56deq\u7684\u8d85\u56fe\u30022.\u5982\u679cq\u662f\u4e00\u4e2a\u8d85\u56fe\uff0c\u6b21q\u88ab\u7d22\u5f15\u4e86\uff0c\u4e0d\u9700\u8981\u7ed9\u6b21q\u7684\u8d85\u56fe\u505averification\u3002\u5982\u679cq\u4e0d\u662f\u4e00\u4e2afrequent subgraph\u7684\u60c5\u51b5\u4e0b\uff0c\u9a8c\u8bc1\u53d7\u5236\u4e8esigmal|D|\u3002\u6797\u6559\u6388\u8ba4\u4e3a\u8fd9\u4e2a\u6c42\u89e3\u8fc7\u7a0b\u7684\u4e3b\u8981\u5f00\u9500\u5728verification\u9636\u6bb5\u3002\u4ed6\u4eec\u7684\u56e2\u961f\u5c31\u662f\u628a\u8fd9\u4e2acost\u663e\u8457\u964d\u4e86\u4e00\u4e0b\uff0c\u800c\u4e14\u601d\u8def\u975e\u5e38\u5730clear\u548csimple\u3002\u4ed6\u603b\u7ed3\u4e86\u4e09\u6761\u7ecf\u9a8c\uff1a 1. Access infrequent labels as early as possible. 2. Retain connectivity\u3002 3. Effectively use degree information. The second contribution of Prof. Lin is to put the the theoretic algorithm into practice.\u6709\u4e24\u4e2a\u95ee\u9898\uff0c\u4e00\u4e2a\u662fquery graph\u88abdata graph\u5305\u542b(contained)\uff0c\u53e6\u4e00\u4e2a\u662fquery graph\u5305\u542b\u4e86data graph.\u6797\u6559\u6388\u7684\u56e2\u961f\u7684\u6700\u7ed3\u6210\u679c\u6bd4\u5df2\u7ecf\u53d1\u8868\u4e86\u8bba\u6587\u7684\u53e6\u4e00\u4e2a\u79d1\u7814\u56e2\u961f\u7684\u6210\u679c\u7684\u901f\u5ea6\u8981\u5feb\u4e86\u4e00\u4e2a\u6570\u91cf\u7ea7\u3002Prof. Lin\u7684\u8bed\u6c14\u663e\u5f97\u6709\u4e9b\u9057\u61be\uff0c\u4ed6\u4eec\u7684\u601d\u8def\u662f\u6b63\u786e\u7684\uff0c\u5b9e\u73b0\u7684\u6548\u7387\u4e5f\u5f88\u9ad8\uff0c\u4f46\u662f\u65f6\u95f4\u4e0a\u6162\u4e86\u5c0f\u5c0f\u3002 http:\/\/ykyi.net zausiu's blog \u53d1\u8a00\u961f\u6bb5\uff0c\u7814\u7a76\u8fd9\u4e2a\u65b9\u5411\u7684\u7518\u540c\u5b66\u95ee\u4e86\u975e\u5e38\u4e13\u4e1a\u7684\u95ee\u9898\uff0c\u6211\u4e0d\u61c2\u554a\uff01\u8fd8\u6709\u4e00\u4f4d\u4fe1\u79d1\u9662\u7684\u7814\u4e00\u540c\u5b66\u95ee\u5230\u4e86\u7559\u5b66\u7684\u95ee\u9898\uff0cProf. Lin\u8bf4\u4ed6\u8981\u6700top\u7684\u5b66\u751f\uff0c\u975e\u5e38\u5730talented\uff0c\u975e\u5e38\u5730diligent, \u975e\u5e38\u5730good at algorithm\uff0c\u8fd8\u8981\u6709\u975e\u5e38\u597d\u7684practical ability\u3002\u671d\u7ea2\u9633\u6559\u6388\u5411\u6797\u6559\u6388\u6253\u542c\u6709\u6ca1\u6709\u505a\u56fe\u8c61search\u65b9\u9762\u7684\u5927\u725b\u3002 \u5b66\u672f\u62a5\u544a\u597d\u96be\u554a\uff01\u6211\u60f3\u542c\u5de5\u7a0b\u7c7b\u7684\u62a5\u544a\u3002\u4f46\u90fd\u662facademic report\u554a\uff01 \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Topic: Graph-based Structure Search   Speaker: Prof. Xuemin Lin School of Computer Science and Enmgineering,University of New South Wales and School of Software ,Eastern China Normal University   Abstract: Recent years have witnessed an emergence of … Continue reading “\u542c\u4e86\u6797\u5b66\u6c11\u6559\u6388\u7684\u4e00\u4e2a\u5b66\u672f\u62a5\u544a”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[3],"tags":[96],"class_list":["post-316","post","type-post","status-publish","format-standard","hentry","category-life_and_others","tag-96"],"_links":{"self":[{"href":"https:\/\/ykyi.net\/index.php?rest_route=\/wp\/v2\/posts\/316","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ykyi.net\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/ykyi.net\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/ykyi.net\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ykyi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=316"}],"version-history":[{"count":0,"href":"https:\/\/ykyi.net\/index.php?rest_route=\/wp\/v2\/posts\/316\/revisions"}],"wp:attachment":[{"href":"https:\/\/ykyi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=316"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/ykyi.net\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=316"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/ykyi.net\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=316"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}