期刊文献+

基于用户需求的信息网络拓扑维上卷模型的研究

Research on Information Network Topology Model Based on User Demand Volume
下载PDF
导出
摘要 随着信息网络的发展,信息网络拓扑维上卷逐渐成为本领域的一个热点,同时它的应用价值也随之提升。对给定节点不上卷,其他节点上卷到指定层次的方法来满足用户的特定需求。提出满足用户需求的信息网络拓扑维上卷模型。主要贡献有:(1)首次提出有效上卷代价的概念,(2)首次实现用户的特定需求上卷,(3)设计信息网络的拓扑维上卷算法。实验证明该算法能够满足用户的特定需求,实现指定拓扑维上卷操作,具有很强的实用价值。 With the development of information networks, the network topology information on the volume dimension is becoming a hot spot in the field, while its value also will increase. The main work is for a given node is not on the volume, the volume to a specified level approach on other nodes to meet the specific needs of the user. It proposed to meet the information needs of users on the network topology dimen- sional volume model. The main contribution is: (1) first proposed the concept of the effective cost of the volume, (2) the first time the specific needs of the user on the volume, (3) design the topological dimension algorithm information on the volume of the network. Ex- periments show that our algorithm can meet the specific needs of users to achieve specified operation on a volume topological dimension, with strong value.
作者 刘松 李川
出处 《现代计算机(中旬刊)》 2016年第3期10-15,24,共7页 Modern Computer
关键词 信息网络 特定需求 拓扑维 上卷 Information Network Specific Requirements Topological Dimension Coil
  • 相关文献

参考文献17

  • 1HAN Jia-wei, YAN Xi-feng, Yu P S. Scalable OLAP and Mining of Information Network[C]. Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT 09). New York, NY, USA: ACM, 2009: 1159.
  • 2HAN Jia-wei, SUN Yi-zhou, Yu P S, et al. Mining Knowledge from Databases: an Information Network Analysis Approach[C]. Pro- ceedings of the 2010 International Conference on Management of Data (SIGMOD 10). New York, NY, USA: ACM, 2010: 1251- 1252.
  • 3Jeong H, Mason S P,Barabasi. A L and Oltvai Z N. Lethality and Centrality in Protein Networks[J]. Nature,2001,411: 41-42.
  • 4Giot L E A, Bader J S, Brouwer C. A Protein Interaction Map of Drosophila Melanogaster[J]. Science,2003,302: 1727-1736.
  • 5Xu X, Hu J, Liu F,Liu L. Scaling and Correlations in Three Bus-transport Networks of China[J]. Physica A, 2007, 374: 441-448.
  • 6Huberman B A,Lukose R M. An Economics Approach to Hard Computational Problems[J]. Science, 1997, 275: 51-54.
  • 7luo J. Analysis of Social Network[M]. Beijing: Social Sciences Academic Press,2005:152-168.
  • 8Zhang P P, Chen K, He Y, et al. Model and Empirical Study on Some Collaboration Networks[J]. Physica A, 2006,360:599-616.
  • 9李洋涛,李川,吴诗极,曾卫,杨尚乾,唐常杰.INVF:面向信息网络的可视化框架与算法[J].计算机科学与探索,2013,7(12):1104-1114. 被引量:2
  • 10李川,赵磊,唐常杰,陈瑜,李靓,赵小明,刘小玲.Graph OLAPing的建模、设计与实现[J].软件学报,2011,22(2):258-268. 被引量:13

二级参考文献97

  • 1陆化普,石冶.Complexity of Public Transport Networks[J].Tsinghua Science and Technology,2007,12(2):204-213. 被引量:13
  • 2Han Jiawei,Kamber Micheline,范明,孟小峰,等译.数据挖掘概念与技术[M].北京:机械工业出版社,2007:424-479.
  • 3Barabasi A L,Bonabeau E.Scale-free networks.Scientific American,2003,288:60~69
  • 4Watts D J,Strogatz S H.Collective dynamics of 'smallworld 'networks.Nature,1998,393:440~442
  • 5Ahmed A,Dywer T,Hong Seok-Hee,et al.Visualisation and Analysis of Large and Complex Scale-free Networks.In:EUROGRAPHICS-IEEE VGTC Symposium on Visualization,2005.1~8
  • 6Eades P.A heuristic for graph drawing.Congressus Nutnerantiunt,1984,42:149~160
  • 7Battista G D,Eades P,Tamassia R,et al.Algorithms for Drawing Graphs:an Annotated Bibliography.Computational Geometry:Theory and Applications,1994,4(5):235~282
  • 8Fruchterman T M J,Reingold E M.Graph Drawing by Force-Directed Placement.Software-Practice and Experience,1991,21(11):1129~1164
  • 9van Ham F,van Wijk J J.Interactive Visualization of Small World Graphs.In:Proceedings of the IEEE Symposium on Information Visualization (INFOVIS'04),Vol 00,2004.199~206
  • 10Harel D,Koren Y.A fast multi-scale method for drawing large graphs.In:Graph Drawing:8th International Symposium (GD'00),2000.183~196

共引文献60

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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