搜索资源列表
kjahan-community-6a3eafe.tar
- Market Newman写的复杂网络的加权GN算法 算法用Python写的 算法的复杂度很高-Market Newman write a complex network with weighted GN algorithm algorithm written in Python complexity of the algorithm is very high
plot_hht
- 基于希尔伯特黄变换和K-means 聚类和数据场理论的复杂网络社团结构探寻.提出和分析了基于K-means 聚类的社团探寻算法和基于数据场理论的社团探寻算法, 并通过实验仿真验证了这两种算法的有效性.-Based on the Hilbert-Huang transform and K-means clustering and data field theory complex network of community structure explore proposed and analyze
SmallHouseNew
- 小区物业管理功能有：小区管理、设备管理、楼盘管理、收费管理、停车管理、用户管理。-Residential property management functions are: community management, equipment management, property management, charge management, parking management, user management.
NMI
- 社团划分的评价标准，计算网络划分的互信息，其值越大说明划分的越准确-One criteria of community detection, the larger of the NMI，the better you get the partition
VRML
- 一个用vrml做的社区交互系统，可以进行一些简单的交互-A community with interactive systems vrml do, you can make some simple interactivity
sf_network-
- 一个具有社团结构的SF网络增长模型的的生成代码-A SF network with community structure (generated code)
k_clique
- CLIQUE聚类算法 CLIQUE是高维数据空间中基于网格和密度的聚类方法。-k-clique algorithm as defined in the paper "Uncovering the overlapping community structure of complex networks in nature and society"- G. Palla, I. Derényi, I. Farkas, and T. Vicsek- Nature 435, 814–818 (2005)
Network_Potential
- 基于网络能量的社区发现分裂算法，定义网络的能量和边能量，依次选择最大能量的边并删除,直到划分出相应的社区。代码有相应的说明-Web-based community discovery energy splitting algorithm, define the network of energy and edge energy, select and delete the maximum energy of the side until the division of the correspon
Scale-free-network
- Albert-László Barabási与Réka Albert在1999年的论文中提出了一个模型来解释复杂网络的无标度特性，称为BA模型。这个模型基于两个假设： 增长模式：不少现实网络是不断扩大不断增长而来的，例如互联网中新网页的诞生，人际网络中新朋友的加入，新的论文的发表，航空网络中新机场的建造等等。 优先连接模式：新的节点在加入时会倾向于与有更多连接的节点相连，例如新网页一般会有到知名的网络站点的连接，新加入社群的人会想与社群中的知名人士结识，新的论文倾向于引用已被广泛引用
CNM-algorithm
- 社区分析算法CNM，可以用来进行社区网络分析- Community analysis algorithm CNM, network analysis can be used for community
EASTL-community
- esstl very good stl tools
cluster_jl
- 根据SCI文章"Fast unfolding of community hierarchies in large networks"给出的算法,实现数据集的聚类.-Iplementate cluster
GN
- 复杂网络中社区划分算法中利用边介数的经典GN算法-Complex network community partitioning algorithm using edge betweenness classic GN algorithm
shetuan
- 利用社团的性质，将节点重度度引进，并且根据节点重要度的关系划分社团，来找出关键节点和关键信息-Using the nature of the community, the nodes to introduce severe degree, and divide communities, according to the relationship of node important degree and key information to find out the key nodes
k
- k均值算法，社区划分算法中经典算法，WSN中分簇也可使用该算法。-K-means algorithm, classic algorithms in community partition algorithm, clustering can also use this algorithm in the WSN.
Douglas-Peuker
- Douglas一Peukcer算法由D.Douglas和T.Peueker于1973年提出，简称D一P算法，是目前公认的线状要素化简经典算法。现有的线化简算法中，有相当一部分都是在该算法基础上进行改进产生的。它的优点是具有平移和旋转不变性，给定曲线与阂值后，抽样结果一定。 算法的基本思路是:对每一条曲线的首末点虚连一条直线,求所有点与直线的距离,并找出最大距离值dmax ,用dmax与限差D相比:若dmax < D ,这条曲线上的中间点全部舍去 若dmax ≥D ,保留dmax 对应的
detection-and-tracking
- 雷达检测跟踪过程无缝连接过程。 雷达检测跟踪过程无缝连接过程。-Detection and tracking are normally considered separate processes. First the signal processing system associated with a sensor examines the signal to determine whether to call detection. Once detection is called, it is
cobra
- Over the past decade, a growing community of researchers has emerged around the use of constraint-based reconstruction and analysis (COBRA) methods to simulate, analyze and predict a variety of metabolic phenotypes using genome-scale models. The COBR
PRE2011Gong
- Memetic 算法在通信网络检测中的应用- Memetic Algorithm for Community Detection in Networks
fast_mo
- 用matlab实现网络中的社区发现功能，保证结果的模块值最大化。-community detection，fast modularity