登录
首页 » matlab » NSGAⅡ

NSGAⅡ

于 2020-03-12 发布
0 178
下载积分: 1 下载次数: 3
我要下载

代码说明：

说明：  利用NSGAII算法进行对复杂网络的社区检测(community detection in complex network)

文件列表：

NSGAⅡ, 0 , 2020-03-03
NSGAⅡ\V1.5, 0 , 2016-08-25
NSGAⅡ\V1.5\community_fitness.m, 794 , 2011-08-31
NSGAⅡ\V1.5\community_fitness_mod.m, 877 , 2011-08-31
NSGAⅡ\V1.5\community_fitness_mod2.m, 817 , 2011-08-31
NSGAⅡ\V1.5\community_fitness_v2.m, 718 , 2011-08-31
NSGAⅡ\V1.5\community_score.m, 708 , 2011-08-31
NSGAⅡ\V1.5\convert_dolphin_to_adjmat.m, 420 , 2011-08-31
NSGAⅡ\V1.5\convert_extgn_to_adjmat.m, 479 , 2011-08-31
NSGAⅡ\V1.5\Datasets, 0 , 2016-08-25
NSGAⅡ\V1.5\Datasets\adjmat_karate_directed.mat, 343 , 2011-08-31
NSGAⅡ\V1.5\Datasets\adjmat_karate_undirected.mat, 409 , 2011-08-31
NSGAⅡ\V1.5\Datasets\dolphin.dat, 903 , 2011-08-31
NSGAⅡ\V1.5\Datasets\dolphin_com.dat, 300 , 2011-08-31
NSGAⅡ\V1.5\decode.m, 1091 , 2011-08-31
NSGAⅡ\V1.5\edges_list.m, 291 , 2011-08-31
NSGAⅡ\V1.5\evaluate_objective.m, 206 , 2011-08-31
NSGAⅡ\V1.5\Generate_edges_for_gephi, 0 , 2016-08-25
NSGAⅡ\V1.5\Generate_edges_for_gephi\edges.csv, 6464 , 2011-08-31
NSGAⅡ\V1.5\Generate_edges_for_gephi\generate_edges_for_gephi.m, 354 , 2011-08-31
NSGAⅡ\V1.5\genetic_operator.m, 2154 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark, 0 , 2016-08-25
NSGAⅡ\V1.5\GNBenchmark\Generate_GNBenchmark.m, 399 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark.m, 845 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_0.mat, 1342 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_1.mat, 1346 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_2.mat, 1346 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_3.mat, 1359 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_4.mat, 1340 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout0_5.mat, 1350 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_0.mat, 1607 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_1.mat, 1602 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_2.mat, 1614 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_3.mat, 1652 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_4.mat, 1620 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout1_5.mat, 1602 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_0.mat, 1754 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_1.mat, 1791 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_2.mat, 1798 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_3.mat, 1728 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_4.mat, 1770 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout2_5.mat, 1802 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_0.mat, 1865 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_1.mat, 1836 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_2.mat, 1887 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_3.mat, 1893 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_4.mat, 1888 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout3_5.mat, 1821 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_0.mat, 1967 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_1.mat, 1942 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_2.mat, 1944 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_3.mat, 1973 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_4.mat, 2016 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout4_5.mat, 1981 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_0.mat, 2021 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_1.mat, 2020 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_2.mat, 1987 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_3.mat, 2086 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_4.mat, 2023 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout5_5.mat, 2002 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_0.mat, 2044 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_1.mat, 2069 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_2.mat, 2045 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_3.mat, 2047 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_4.mat, 2071 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout6_5.mat, 2078 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_0.mat, 2094 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_1.mat, 2098 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_2.mat, 2110 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_3.mat, 2111 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_4.mat, 2063 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout7_5.mat, 2084 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_0.mat, 2094 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_1.mat, 2144 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_2.mat, 2100 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_3.mat, 2130 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_4.mat, 2056 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark\GNBenchmark_kout8_5.mat, 2085 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext, 0 , 2016-08-25
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.00.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.05.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.10.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.15.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.20.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.25.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.30.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.35.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.40.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.45.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\community-0.50.dat, 660 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.00.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.05.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.10.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.15.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.20.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.25.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.30.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.35.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.40.dat, 12928 , 2011-08-31
NSGAⅡ\V1.5\GNBenchmark_Ext\network-0.45.dat, 12928 , 2011-08-31

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • dtsII91
    In telecommunications, direct-sequence spread spectrum (DSSS) is a modulation technique. As with other spread spectrum technologies, the transmitted signal takes up more bandwidth than the information signal that modulates the carrier or broadcast frequency. The name spread spectrum comes from the fact that the carrier signals occur over the full bandwidth (spectrum) of a device s transmitting frequency.
    2013-01-05 03:33:59下载
    积分：1
  • classify
    Image Texture Classification Using Combined Grey Level Co-Occurrence Probabilities and Support Vector Machines Texture refers to properties that represent the surface or structure of an object and is defined as something consisting of mutually related elements. The main focus in this study is to do texture segmentation and classification for texture digital images. Grey level co-occurrence probabilities (GLCP) method is being used to extract features from texture image. Gaussian support vector machines (GSVM) have been proposed to do classification on the extracted features. A popular Brodatz texture album had been chosen to test out the result. In this study, a combined GLCP-GSVM shows an improvement over GLCP in terms of classification accuracy.
    2012-05-25 22:21:28下载
    积分：1
  • LitSurveyReport
    literature survey-underwater pipeline tracking
    2014-10-27 14:06:19下载
    积分：1
  • SharpPart
    sharppart function for wavelet analysis
    2013-05-15 03:28:26下载
    积分：1
  • CalculatioofPartitionConvolutionBasedOnTheMATLAB
    线性卷积要求两个输人序列具有持续时间，但在实际应用中，可能遇到输人序列具有无限持续时间的情况。在这种情况下，分段卷积是一种有效的解决方案。文章讨论了计算分段卷积的两种方法。仿真试验表明，分段卷积方法正确且高效。(The linear convolution needs two finite-time input sequences, but in the actual application, two infi- nite-time input sequences are possible. Under this kind of situation, the partition convolution is an effective solu- tion. In this paper, two methods of the partition convolution are discussed. The simulation experiment indicatesthat the partition convolution is correct and effective.)
    2009-11-02 12:49:48下载
    积分：1
  • DMERR
    说明：  一种基于动态路径损耗指数的最小能耗中继路由 (Dynamic Minimum Energy Relay Routing，DMERR）算法，该算法能够获取巷道内各处准确的路径损耗指数，准确计算巷道内每处的最佳通讯距离，从而节省通信能量。(the Minimum Energy Relay Routing (DMERR) algorithm which is based on dynamic path loss parameter is proposed, this algorithm can save the energy of communication by obtain the exact path loss parameter of each place in roadways and calculation the optimum communication distance accurately. )
    2011-03-21 09:44:53下载
    积分：1
  • racine-primitive
    programme permet de calculer la racine primitive
    2011-04-22 22:35:05下载
    积分：1
  • ShortPath
    Dijkstra最短路算法实现：求任意两点间的最短路；任一点到其它各点的最短路(Dijkstra shortest path algorithm)
    2012-01-05 22:29:28下载
    积分：1
  • TDOAFangAlgrithm
    TDOA无源时差定位Fang算法，matlab源码(Fang Passive TDOA TDOA location algorithm, matlab source code)
    2010-03-11 15:22:37下载
    积分：1
  • quadrotorcontrol
    针对六自由度欠驱动四旋翼无人飞行器(QuadmtoruAV)受控模型的复杂非线性问题，提出了一种系统简化方 法，并基于简化后的模型设计了滑模控制器，(a useful papaer for rotor)
    2014-09-12 11:37:50下载
    积分：1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2025 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！