dynamic clustering using particle swarm optimization with application in unsupervised imagenew

dynamic clustering using particle swarm optimization with application in unsupervised imagenew

ID:34620400

大小:379.63 KB

页数:6页

时间:2019-03-08

dynamic clustering using particle swarm optimization with application in unsupervised imagenew_第1页
dynamic clustering using particle swarm optimization with application in unsupervised imagenew_第2页
dynamic clustering using particle swarm optimization with application in unsupervised imagenew_第3页
dynamic clustering using particle swarm optimization with application in unsupervised imagenew_第4页
dynamic clustering using particle swarm optimization with application in unsupervised imagenew_第5页
资源描述:

《dynamic clustering using particle swarm optimization with application in unsupervised imagenew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、PROCEEDINGSOFWORLDACADEMYOFSCIENCE,ENGINEERINGANDTECHNOLOGYVOLUME9NOVEMBER2005ISSN1307-6884DynamicClusteringusingParticleSwarmOptimizationwithApplicationinUnsupervisedImageClassificationMahamedG.H.Omran,AndriesPEngelbrecht,andAyedSalmanHowever,hierarchic

2、alclusteringtechniquessufferfromtheAbstract—Anewdynamicclusteringapproach(DCPSO),basedfollowingdrawbacks:onParticleSwarmOptimization,isproposed.ThisapproachisñTheyarestatic,i.e.datapointsassignedtoaclusterappliedtounsupervisedimageclassification.Thepropo

3、sedapproachcannotmovetoanothercluster.automaticallydeterminesthe"optimum"numberofclustersandñTheymayfailtoseparateoverlappingclustersduetoasimultaneouslyclustersthedatasetwithminimaluserinterference.lackofinformationabouttheglobalshapeorsizeoftheThealgor

4、ithmstartsbypartitioningthedatasetintoarelativelylargenumberofclusterstoreducetheeffectsofinitialconditions.Usingclusters.binaryparticleswarmoptimizationthe"best"numberofclustersisselected.ThecentersofthechosenclustersisthenrefinedviatheK-Ontheotherhand,

5、partitionalclusteringalgorithmsmeansclusteringalgorithm.Theexperimentsconductedshowthatpartitionthedatasetintoaspecifiednumberofclusters.Thesetheproposedapproachgenerallyfoundthe"optimum"numberofalgorithmstrytominimizecertaincriteria(e.g.asquareerrorclus

6、tersonthetestedimages.function)andcanthereforebetreatedasoptimizationproblems.TheadvantagesofhierarchicalalgorithmsaretheKeywords—ClusteringValidation,ParticleSwarmOptimization,UnsupervisedClustering,UnsupervisedImageClassification.disadvantagesofthepart

7、itionalalgorithmsandviceversa.PartitionalclusteringtechniquesaremorepopularthanI.INTRODUCTIONhierarchicaltechniquesinpatternrecognition[2],hence,thispaperwillconcentrateonpartitionaltechniques.ATAclusteringistheprocessofidentifyingnaturalDgroupingsorclus

8、ters,withinmultidimensionaldata,Partitionalclusteringaimstooptimizeclustercenters,aswellasthenumberofclusters[10].Mostclusteringbasedonsomesimilaritymeasure(e.g.Euclideandistance)algorithmsrequirethenumberofclusterstobespe

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。