資源簡介
matlab中用K-means進行社區(qū)劃分,通過度最大的點,邊的介數(shù)和點的介數(shù)求影響力最大化
代碼片段和文件信息
filename=‘C:\Users\Administrator\Desktop\論文\基于蟻群算法的復雜網絡社團發(fā)現(xiàn)新方法\GraphsCluster\karateClub.txt‘;
fileType=‘AdjMat‘;
%?G是存放概率的鄰接矩陣Ge是鄰接矩陣
G=loadData(filenamefileType);
Ge=G;
Ge(Ge~=0)=1;
[IdxCsumDD]=kmeans(Ge3);
[nodearc]=betweenness_centrality(sparse(Ge));
X=full(arc);
Sum=sum(X);
SumT=Sum‘;
Arc=[(1:length(Idx))‘SumT];
A=sortrows(Arc-2);
S1=A(11);
S2=[S1A(21)];
S3=[S2A(31)];
S4=[S3A(41)];
S5=[S4A(51)];
??G(S1S1)=1;
????G1=G;
????Ac=RandCas(G1);
????I1=length(Ac(Ac~=0));?
????????a=S2(11);
????????b=S2(12);
????????G(aa)=1;
????????G(bb)=1;
?????????G2=G;
?????Ac=RandCas(G2);
?????I2=length(Ac(Ac~=0));?
?????
????????a=S3(11);
????????b=S3(12);
????????c=S3(13);
????????G(aa)=1;
????????G(bb)=1;
????????G(cc)=1;
????????G3=
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1391??2018-04-15?09:44??New?Folder\edgeBetweeness.m
?????文件????????197??2018-05-02?20:09??New?Folder\haha.m
?????文件???????2582??2018-04-10?17:11??New?Folder\karateClub.txt
?????文件???????3901??2018-05-02?11:02??New?Folder\Kmeans1.m
?????文件????????827??2018-04-12?11:22??New?Folder\loadData.m
?????文件???????3711??2018-04-14?11:51??New?Folder\PointBetweeness.m
?????文件????????562??2018-04-10?19:39??New?Folder\RandCas.m
?????文件????????124??2018-04-15?09:45??New?Folder\Tu1.m
?????目錄??????????0??2018-05-02?21:04??New?Folder
-----------?---------??----------?-----??----
????????????????13295????????????????????9
- 上一篇:NSGA2代碼;非常使用的遺傳算法代碼
- 下一篇:功率控制與資源分配仿真與分析
評論
共有 條評論