期刊文献+

基于改进力导向模型和局部密度的聚类算法 被引量:1

Clustering algorithm based on improved force-directed model and local density
下载PDF
导出
摘要 在没有先验知识的前提下,聚类是分析样本集中不同类簇的有效方式。文中提出了一种基于改进力导向模型的聚类算法。为实现样本数据预处理的类内聚集和类间分离效果,设计了基于样本点局部密度和样本间距离的吸引力计算方法、基于样本点近邻连通图中边的介数的排斥力计算方法。实验结果表明,文中算法能够使得类内样本点更加聚集、类间样本点更加分离,可以有效地提高聚类的正确率。 Clustering is an effective way to analyze different clusters in sample sets without prior knowledge.In this paper,a clustering algorithm based on improved force-directed model is proposed.In order to achieve the effect of intra-class clustering and inter-class separation of sample data preprocessing,an attractive force calculation method based on local density of sample points and distance between samples is designed,and so is a repulsive force calculation method based on the betweenness of edges in the nearest neighbor connected graph of sample points.The experimental results show that the proposed algorithm can make the sample points of intra-class more clustering and the sample points of inter-class more separated,which can effectively improve the correct rate of clustering.
作者 刘风剑 刘向阳 LIU Feng-jian;LIU Xiang-yang(College of Science,Hohai University,Nanjing 211100,China)
机构地区 河海大学理学院
出处 《信息技术》 2019年第10期51-54,58,共5页 Information Technology
基金 国家自然科学基金(61001139)
关键词 力导向模型 局部密度 聚类 边介数 force-directed model local density clustering edge betweenness
  • 相关文献

参考文献2

二级参考文献14

  • 1李洁,高新波,焦李成.基于特征加权的模糊聚类新算法[J].电子学报,2006,34(1):89-92. 被引量:114
  • 2GimnM,NewmanMEJ.Commnunitystructureinsocialandbiologicalnetworks[C]//ProceedingsoftheNationalAcademyofSciences,2002:7821-7826. 被引量:1
  • 3FortunatoS.Communitydetectioningraphs[J].PhysicsReports,2010,486(3):75-174. 被引量:1
  • 4MichelleGirvan,NewmanMEJ.Fastalgorithmfordetectioncommunitystructureinnetworks[J].PhysicalReview E,2004,69(2):66-113. 被引量:1
  • 5NewmanM E J. Modularity and community structure innetworks[C]//Proceedings ofthe NationalAcademy ofSciences,2006:8577-8582. 被引量:1
  • 6PonsP,LatapyM.Computingcommunitiesinlargenetworksusingrandomwalks[J].LNCS2005.3733:284-293. 被引量:1
  • 7TamassiaEades.Aheuristicforgraphdrawing[J].CongressusNumerantium,1984,42:149-160. 被引量:1
  • 8KamadaT,KawaiS. An algorithm fordrawing generalundirectedgraphs[J].InformationProcessingLetters,1989.31(1):7-15. 被引量:1
  • 9FruchtermanTM J,ReigoldEM.Graphdrawingbyforcedirectedplacement[J].SoftwarePracticeandExperience,1991,21(11):1129-1164. 被引量:1
  • 10NoackA.Anenergymodelforvisualgraphclustering[C]//GraphDrawing,LectureNotesinComputerScience,2004:425-436. 被引量:1

共引文献1073

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部