登录 | 注册 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
基于Hadoop的电信频繁交往圈算法研究
参考文献
  • [1] 张光卫,康建初,夏传良,李鹤松. 复杂网络集团特征研究综述. 计算机科学, 2006,10
  • [2] 白云龙. 基于Hadoop的数据挖掘算法研究与实现. 北京邮电大学, 2011
  • [3] Etsuji Tomita;Akira Tanaka;Haruhisa Takahashi. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical computer science, 2006,1
  • [4] 段云峰;吴唯宁;李剑威. 数据仓库及其在电信领域中的应用. 北京:电子工业出版社, 2003
  • [5] Feng Zhao;Anthony K. H. Tung. Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis. VLDB Endowment, 2012
  • [6] . http://hadoop.apache.org/
  • [7] R. Albert;A.-L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 2002
  • [8] Cohen, J. Graph Twiddling in a MapReduce World. Computing in Science and Engineering, 2009,04
  • [9] Yuxiao Dong;Qing Ke;Yanan Cai. TeleData:Data Mining, Social Network Analysis and Statistics Analysis System Based on Cloud Computing in Telecommunication Industry. 2011
  • [10] Jonathan Cohen. Trusses:Cohesive Subgraphs for Social Network Analysis. National Security Agency Technical Report, 2008
  • [11] Brian Alspach;Heather Gavlas;Mateja Sajna. Cycle decompositions IV:complete directed graphs and fixed length directed cy-cles. Journal of Combinatorial Theory Series A, 2003
查看更多︾
相似文献 查看更多>>
3.227.252.54