面向内容和结构的关键字图查询方法  

A Keyword Search Method for Graphs by Considering Content and Structure

作　　者：张志强[1] 夏得萍 谢晓芹[1] 潘海为[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机辅助设计与图形学学报》2015年第11期2211-2221,共11页Journal of Computer-Aided Design & Computer Graphics

基　　金：国家自然科学基金(61370084;61202090;61272184);教育部新世纪人才支持计划(NCET-11-0829);黑龙江省自然科学基金(F201130);哈尔滨市科技创新人才研究专项资金(2015RQQXJ067);中央高校基本科研业务费专项资金(HEUCF100602)

摘　　要：为了在数据图上查找能够包含所有或部分查询关键字的子图,提出一种关键字图查询方法.首先通过Page Rank和查询关键字所处位置这2个因素对语言模型进行完善,克服搜索结果时只考虑距离关系而未考虑节点和查询关键字之间相似性的不足;其次提出节点搜索算法以及结果生成算法,为用户返回与查询相关且节点之间结构更加紧密的结果子图,将任意2个关键字节点之间最相关的连接关系表现出来.实验结果表明,该方法能够为用户返回更符合查询需求的结果.A new keyword search method is proposed to look for the subgraphs which should contain all or part of the query keywords on the data graph. First, we consider two factors, PageRank and the keyword position, to overcome the weakness of current works which only considered distance relationship between nodes and ignored the similarity between node and query during searching. Second, we design new algorithms for node searching and result generating. The closest relationship between two nodes can be obtained. At last, we verified this me-thod could return results with higher quality.

关 键 词：关键字查询 潜在斯坦纳图 子图排序 内容与结构 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]