期刊文献+

复杂空航信息网络枢纽节点的高效发现 被引量:1

Efficient discovery of Hub nodes in complex aero-space information network
原文传递
导出
摘要 针对空航信息网络复杂度高、实时性强、数据规模大的特点,通过大量实验分析,提出基于额外窗口(AW)的信息网络Top-k接近中心度核心节点挖掘算法.在不同数据集上的大量实验表明:本文算法在人工和真实数据集上能保证80%以上的准确率,在给定的几种AW中平均处理时间减少约50%. 针对空航信息网络复杂度高、实时性强、数据规模大的特点,通过大量实验分析,提出基于额外窗口(AW)的信息网络Top-k接近中心度核心节点挖掘算法.在不同数据集上的大量实验表明:本文算法在人工和真实数据集上能保证80%以上的准确率,在给定的几种AW中平均处理时间减少约50%.
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第S1期394-397,共4页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(61103043 61173099) 国家十二五科技支撑计划资助项目(2012BAG04B02) 高等学校博士学科点专项科研基金资助项目(20090181120064) 华为创新计划资助项目(YJCB2011036RE)
关键词 空航信息网络 社会网络 异步上卷 接近中心度 额外窗口 aero-space information network social work asynchronous roll-up closeness centrality additional window
  • 相关文献

参考文献8

  • 1李川,赵磊,唐常杰,陈瑜,李靓,赵小明,刘小玲.Graph OLAPing的建模、设计与实现[J].软件学报,2011,22(2):258-268. 被引量:13
  • 2Han Jiawei,Yan Xifeng,Yu P S.Scalable OLAPand mining of information networks. EDBT′09Proceedings of the 12th International Conference onExtending Database Technology:Advances in Data-base Technology . 2009
  • 3Han Jiawei,Sun Yizhou,Yu P S,et al.Miningknowledge from databases:an information networkanalysis approach. SIGMOD′10Proceedings ofthe 2010international conference on Management ofdata . 2010
  • 4Chen Chen,Yan Xifeng,Han Jiawei,et al.GraphOLAP:towards online analytical processing ongraphs. Eighth IEEE International Conferenceon Data Mining . 2008
  • 5Yu P S,Han Jiawei.Link mining:models,algo-rithms and applications. . 2010
  • 6L. C. Freeman.Centrality in Social Networks - Conceptual Clarification. Social Networks . 1978
  • 7D.Koschützki,K.A.Lehmann,L.Peeters,S.Richter,D.Tefelde-Podehl,O.Zlotowski."Centrality indices,". Network Analysis . 2005
  • 8Qu Qiang,Zhu Feida,Han Jiawei,et al.Efficient topological OLAP on information networks. Proceedings of the16th International Conference on Database Systems for Advanced Applications (DASFAA11) . 2011

二级参考文献1

共引文献12

同被引文献16

  • 1杨尚乾,李川,唐常杰,曾卫.基于拓扑维上卷的空航信息网络枢纽节点发现[J].华中科技大学学报(自然科学版),2012,40(S1):280-283. 被引量:2
  • 2王柏,吴巍,徐超群,吴斌.复杂网络可视化研究综述[J].计算机科学,2007,34(4):17-23. 被引量:44
  • 3HAN 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.
  • 4HAN 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.
  • 5Jeong H, Mason S P,Barabasi. A L and Oltvai Z N. Lethality and Centrality in Protein Networks[J]. Nature,2001,411: 41-42.
  • 6Giot L E A, Bader J S, Brouwer C. A Protein Interaction Map of Drosophila Melanogaster[J]. Science,2003,302: 1727-1736.
  • 7Xu X, Hu J, Liu F,Liu L. Scaling and Correlations in Three Bus-transport Networks of China[J]. Physica A, 2007, 374: 441-448.
  • 8Huberman B A,Lukose R M. An Economics Approach to Hard Computational Problems[J]. Science, 1997, 275: 51-54.
  • 9luo J. Analysis of Social Network[M]. Beijing: Social Sciences Academic Press,2005:152-168.
  • 10Zhang P P, Chen K, He Y, et al. Model and Empirical Study on Some Collaboration Networks[J]. Physica A, 2006,360:599-616.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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