搜索资源列表
Community-structure
- 复杂网络社团结构的识别算法GN算法，2002年提出-community structure in social and biological networks
giant_component
- 复杂网络中很多网络不连通，给很多算法带来很大不方便，次代码用来求出网络中孤立点和最大联通区间-obtain the gaint component of networks
analysis
- 分析复杂网络中节点度大小，并一一剔去度小的点，我们得到k-shell的算法代码，得到一个网络的核。-obtain the shell of network
EO
- 针对网络社团划分的EO算法（WEO算法），对于研究复杂网络很有帮助！-matlab Code for Complex Network Community
spectral_clustering
- 谱图法的Matlab实现，复杂网络社区挖掘算法很常用的算法-Spectrum chart Matlab, the complex network community mining algorithm is very common algorithm
conplex-network-visualization-review
- 本文全面介绍了复杂网络可视化技术的研究进展，讨论了可视化布点算法 和压缩算法，并介绍了若干具有代表性的复杂网络可视化工具、列举了复杂网络可视化技术在相关领域的应用-This article fully describes the complex network visualization technology progress, discuss the visualization of distribution algorithms and compression algorithms, a
matlab
- 复杂网络相似性指标的实现和对比，同时可以实现无标度网络和邻耦网络两个复杂网络的预测。并对预测结果进行评估。改进了预测算法，提出了预测精度评价的新指标，使精度评价更准确。-Implementation and comparison of the complex network of similar indicators, and can achieve scale-free network and neighbor coupled network prediction of two complex
Shortest_Path_F
- 求复杂网络中两节点i1与i2间的最短路径及其长度 采用Floyd算法计算两节点的距离-Demand complex networks, two nodes i1 and i2 between the shortest path and its length using the Floyd algorithm to calculate the distance of two nodes
Community_BGLL_CPP
- 复杂网络中社团划分的BGLL算法，算法在ubantu下的环境运行，对于学习复杂网络社团研究的同学有一定帮助-The complex network of community of the classification of the BGLL algorithm, the algorithm of the environment in ubantu operation, to learn the complex network of research community classmates ha
The-programming-collective-wisdom
- 《集体智慧编程》(programming collective intelligence building smart web 2.0 applications)以机器学习与计算统计为主题背景，专门讲述如何挖掘和分析web上的数据和资源，如何分析用户体验、市场营销、个人品味等诸多信息，并得出有用的结论，通过复杂的算法来从web网站获取、收集并分析用户的数据和反馈信息，以便创造新的用户价值和商业价值。全书内容翔实，包括协作过滤技术（实现关联产品推荐功能）、集群数据分析（在大规模数据集中发掘相似的数
node1
- 基于节点类型的复杂网络模块探测算法.pdf-Algor ithm for detecting module structure in complex networks ba sed on node type
LPA(C)
- 复杂网络的结构检测室近几年的研究热点，目前最快的算法是标签传播！-Community detection is hot topic in recent years. The most fast algorithm for community detection is Label Propagation Algorithm(LPA),and this is the program!
Hopcroft_Karp
- 用于复杂网络中二分图的几种算法，包括著名的匈牙利算法等-For complex network of binary chart in several kinds of algorithm, including the famous Hungarian algorithm, etc
GN
- GN算法，一种复杂网络的社团划分算法。是一种很实用的社团划分算法。-GN algorithm, a complex network of community partitioning algorithm.
Hopcroft-Karp
- 复杂网络中寻找最大匹配的Hopcroft-Karp算法的java实现代码，希望对大家有用-Looking for the biggest match in the complex network Hopcroft-Karp algorithm to achieve the java code, the hope that useful
clustering_coefficients
- 关于复杂网络的聚类系数算法，用matlab计算，矩阵为稀疏矩阵。-clustering_coefficients(A) returns the clustering coefficients for all vertices in A. The clustering coefficient is the ratio of the number of edges between a vertex s neighbors to the total possible number of edges
Community
- 一种快速的复杂网络中社团发现算法，算法的论文为：Fast unfolding of communities in large networks
ExtractorDktj131_2012
- 基于复杂网络的新闻网页解析算法，实现复杂网络构建及分词功能-Built complex network based on complex network news page parsing algorithm, and the word function
TSP
- TSP问题是一个典型的、容易描述但是难以处理的NP完全问题，同时TSP问题也是诸多领域内出现的多种复杂问题的集中概括和简化形式。目前求解TSP问题的主要方法有启发式搜索法、模拟退火算法、遗传算法、Hopfield神经网络算法、二叉树描述算法。所以，有效解决TSP问题在计算理论上和实际应用上都有很高的价值，而且TSP问题由于其典型性已经成为各种启发式的搜索、优化算法的间接比较标准(如遗传算法、神经网络优化、列表寻优(TABU)法、模拟退火法等)。遗传算法就其本质来说，主要是解决复杂问题的一种鲁棒性
TopologyCreate
- 复杂网络拓扑生存算法，对可能出现的拓扑不连通的状况进行了考虑，并支持网络拓扑的动态变化-Survival of a complex network topology algorithm, consider the situation that may appear disconnected topology and supports dynamic changes in the network topology