期刊文献+

基于语义分析的大规模动态图形相似节点查询算法 被引量:1

Query Algorithm for Similar Nodes in Large Scale Dynamic Graphics Based on Semantic Analysis
下载PDF
导出
摘要 随着动态图形在网络应用领域的发展与扩展,针对当前相似节点查询算法存在运行响应速度慢、查询占用的存储空间较大、容易受到外界因素干扰而导致查询精确度不佳等问题,提出基于语义分析的大规模动态图形相似节点查询算法。首先,依据语义分析的方法,对动态图形相似节点数据进行预处理,获取节点相似性函数;其次,针对当前节点在不同时刻的相似性函数,设计相应的矩阵以增强计算效率;最后,将求出的节点相似程度值按照升序顺序进行排列,将相似程度值最高的节点看作相似节点,实现相似节点的查询。实验结果表明,所提算法查询速度快,查询精确度较高。 With the expansion and development of the dynamic graphics in the field of network application,in view of the current query algorithm has similar node running slow response speed and occupy storage space query is large vulnerable to the interference of external factors caused problems such as poor query accuracy,large-scale dynamic graphics were proposed semantic analysis based on similarity query node algorithm. First of all,on the basis of the method of semantic analysis,the node data of dynamic graphics similar was preproced to obtain node similarity function. Secondly,according to the current node similarity function in different time,the design of the corresponding matrix was enhanced the calculation efficiency. Finally,the node calculated similarity values are arranged in ascending order,will be similar to the highest degree nodes as similar nodes,achieve similar node query. Experimental results show that the proposed algorithm has fast query speed and high query accuracy.
作者 陈熔
出处 《科学技术与工程》 北大核心 2018年第3期279-284,共6页 Science Technology and Engineering
关键词 语义分析 大规模 动态图形 相似节点 查询算法 semantic analysis large scale dynamic graphics similar nodes query algoritiim
  • 相关文献

参考文献10

二级参考文献98

  • 1王桂宾,周来水,邓冬梅.基于模拟退火算法的矩形件排样[J].中国制造业信息化(学术版),2006,35(8):65-67. 被引量:7
  • 2周树德,孙增圻.分布估计算法综述[J].自动化学报,2007,33(2):113-124. 被引量:209
  • 3ZHANG De-Fu CHEN Sheng-Da LIU Yan-Juan.An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem[J].自动化学报,2007,33(9):911-916. 被引量:4
  • 4郭聪敏.图集的子图查询算法研究[D].秦皇岛:燕山大学,2011.
  • 5Deshpande A, Guestrin C, Madden S, et al. Model-driven data ac- quisition in sensor networks [A]. Proc of the 2004 Int'l Conf on Very Data Bases [C]. San Francisco: Morgan Kaufmann, 2004, 588-599.
  • 6Chu D, Deshpand A, Hellerstein J M, et al. Approximate data col- lection in sensor networks using probabilistic models [A~. IEEE 22nd Int~ 1 Con/on Data Engineering [C]. Atlanta, 2006.
  • 7Wu M J, Tang X Y. Monitoring Top-k query in wireless sensor networks [A]. Proc of the 2006 Int' 1 Con/on Data Engineering [C]. Los Alamitos, IEEE Computer Society Press, 2006.
  • 8Intel labs Berkeley. Intel Berkeley Research Lab Data [EB/OL]. http: //db. csail, mit. edu/labdata/labdata, html, 2004.
  • 9Chu D, Deshpand A, Hellerstein J M, et al. Approximate data col- lection in sensor networks using probabilistic models [A]. IEEE 22nd Int~ 1 Con{ on Data Engineering[C]. Atlanta, 2006.
  • 10Wu M J, Tang X Y. Monitoring Top-k query in wireless sensor networks [A] Proc of the 2006 Int~ 1 Con{ on Data Engineering EC~. Los Alamitos, IEEE Computer Society Press, 2006.

共引文献40

同被引文献9

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部