简介:一个网络的聚类的系数C,是在各种各样的节点的邻居之间的直接连接的一项措施,从0(为没有连接)到1(为完整的连接)。我们基于在从一个来源节点的距离h的节点定义一个小世界的网络的扩大聚类的系数C(h),因此概括distance-1邻居在计算平常的聚类系数C=C(1)采用了。在一个网络关于距离分发Pδ(h)基于已知的结果,也就是说概率顶点的随机选择的对有距离h,我们发源;试验性地验证法律Pδ(h)C(h)≤c木头N/N,在c是很少超过1的一个小常数的地方。因为它证明产品Pδ(h)C(h)由是比为Pδ(h)的最大的价值的产品更加小的价值是上面界限的,这结果是重要的;C(h)。聚类系数扩大;管理他们的法律提供新卓见进小世界的网络的结构;为他们的性质的进一步的探索开创大街。
简介:Basedonimmuneclusteringandevolutionaryprogramming(EP),ahybridalgorithmtotraintheRBFnetworkisproposed.AnimmunefuzzyC-meansclusteringalgorithm(IFCM)isusedtoadaptivelyspecifytheamountandinitialpositionsoftheRBFcentersaccordingtoinputdataset;thentheRBFnetworkistrainedwithEPthattendstoglobaloptima.TheapplicationofthehybridalgorithminmultluserdetectionproblemdemonstratesthattheRBFnetworktrainedwiththealgorithmhassimplenetworkstructurewithgoodgeneralizationability.
简介:非教师学习,组织工会,记忆,和噪音抵抗是特征的,人工的免疫系统是聪明的信息处理的领域里的一个研究焦点。基于有免疫力的有机体和同种细胞的选择的基本原则,这篇文章介绍聚类自我改编的算法特征的polyclonal。根据算法的核心想法,在人工的免疫系统的各种各样的有免疫力的操作符在聚类的进程被采用;而且,聚类数字根据亲密关系功能被调整。再结合操作员的介绍能有效地在一张产生人口提高单个抗体的差异,以便为答案的寻找的范围被扩大,算法的早熟的现象被避免。而且,不一致的变化操作符的介绍提高适应性并且优化本地答案寻求的性能。同时,算法的集中被加速。另外,文章也由采用Markov链证明算法的集中。数据模拟实验的结果证明算法能够获得合理、有效的簇。
简介:Inthispaper,weproposeadimension-reducing,K-meanclusteringprocedurebyProjectionPursuit(PP)techniquesoastoexploretheclusteringstructureofdatainhigh-dimensionalspaceintermsoflow-dimensionalprojectivepointsofdata,andweobtainthea.s.consistenceoftheestimatesoftheclustercentersandprojectionorientations.
简介:Dataclusteringisasignificantinformationretrievaltechniqueintoday’sdataintensivesociety.Overthelastfewdecadesavastvarietyofhugenumberofdataclusteringalgorithmshavebeendesignedandimplementedforallmostalldatatypes.Thequalityofresultsofclusteranalysismainlydependsontheclusteringalgorithmusedintheanalysis.Architectureofaversatile,lessuserdependent,dynamicandscalabledataclusteringmachineispresented.Themachineselectsforanalysis,thebestavailabledataclusteringalgorithmonthebasisofthecredentialsofthedataandpreviouslyuseddomainknowledge.Thedomainknowledgeisupdatedoncompletionofeachsessionofdataanalysis.
简介:Formanyclusteringalgorithms,itisveryimportanttodetermineanappropriatenumberofclusters,whichiscalledclustervalidityproblem.Inthispaper,anewclusteringvalidityassessmentindexisproposedbasedonanovelmethodtoselectthemarginpointbetweentwoclustersforin-ter-clustersimilaritymoreaccurately,andprovidesanimprovedscatterfunctionforintra-clustersimilarity.Simulationresultsshowtheeffectivenessoftheproposedindexonthedatasetsunderconsiderationregardlessofthechoiceofaclusteringalgorithm.
简介:TheChi-Chiearthquakein1999causeddisastrouslandslides,whichtriggerednumerousdebrisflowsandkilledhundredsofpeople.Acriticalrainfallintensitylineforeachdebris-flowstreamisstudiedtopreventsuchadisaster.However,settingrainfalllinesfromincompletedataisdifficult,sothisstudyconsideredeightcriticalfactorstogroupstreams,suchthatstreamswithinaclusterhavesimilarrainfalllines.Ageneticalgorithmisappliedtogroup377debris-flowstreamsselectedfromthecenterofanareaaffectedbytheChi-Chiearthquake.Thesestreamsaregroupedintosevenclusterswithdifferentcharacteristics.Theresultsrevealthattheproposedmethodeffectivelygroupsdebris-flowstreams.
简介:Mostoftheearlierworkonclusteringmainlyfocusedonnumericdatawhoseinherentgeometricpropertiescanbeexploitedtonaturallydefinedistancefunctionsbetweendatapoints.However,dataminingapplicationsfrequentlyinvolvemanydatasetsthatalsoconsistsofmixednumericandcategoricalattributes.Inthispaperwepresentaclusteringalgorithmwhichisbasedonthek-meansalgorithm.Thealgorithmclustersobjectswithnumericandcategoricalattributesinawaysimilartok-means.Theobjectsimilaritymeasureisderivedfrombothnumericandcategoricalattributes.Whenappliedtonumericdata,thealgorithmisidenticaltothek-means.Themainresultofthispaperistoprovideamethodtoupdatethe'clustercenters'ofclusteringobjectsdescribedbymixednumericandcategoricalattributesintheclusteringprocesstominimisetheclusteringcostfunction.Theclusteringperformanceofthealgorithmisdemonstratedwiththetwowellknowndatasets,namelycreditapprovalandabalonedatabases.
简介:Thispaperpresentsanewefficientalgorithmforclusteringcategoricaldata,Squeezer,whichcanproducehighqualityclusteringresultsandatthesametimedeservegoodscalability.TheSqueezeralgorithmreadseachtupletinsequence,eitherassigningttoanexistingcluster(initiallynone),orcreatingtasanewcluster,whichisdeterminedbythesimilaritiesbetweentandclusters.Duetoitscharacteristics,theproposedalgorithmisextremelysuitableforclusteringdatastreams,wheregivenasequenceofpoints,theobjectiveistomaintainconsistentlygoodclusteringofthesequencesofar,usingasmallamountofmemoryandtime.OutlierscanalsobehandledefficientlyanddirectlyinSqueezer.Experimentalresultsonreal-lifeandsyntheticdatasetsverifythesuperiorityofSqueezer.
简介:Imagesegmentation,asabasicbuildingblockformanyhigh-levelimageanalysisproblems,hasattractedmanyresearchattentionsoveryears.Existingapproaches,however,aremainlyfocusingontheclusteringanalysisinthesinglechannelinformation,i.e.,eitherincolororspatialspace,whichmayleadtounsatisfactorysegmentationperformance.Consideringthespatialandcolorspacesjointly,thispaperproposesanewhierarchicalimagesegmentationalgorithm,whichalternatelyclusterstheimageregionsincolorandspatialspacesinafinetocoarsemanner.Withoutlosingtheperceptualconsistence,theproposedalgorithmachievesthesegmentationresultusingonlyveryfewnumberofcolorsaccordingtouserspecification.
简介:Themainfunctionofelectronicsupportmeasuresystemistodetectthreatingsignalsinordertotakecountermeasuresagainstthem.Toaccomplishthisobjective,aprocessofassociatingeachinterleavedpulsewithitsemittermustbedone.Thisprocessistermedsortingorde-interleaving.Anovelpointsymmetrybasedradarsorting(PSBRS)algorithmisaddressed.Inordertodealwithallkindsofradarsignals,thesymmetrymeasuredistanceisusedtoclusterpulsesinsteadoftheconventionalEuclideandistance.Thereferencepointsofthesymmetricalclustersareinitializedbythealternativefuzzyc-means(AFCM)algorithmtoamelioratetheeffectsofnoiseandthefalsesorting.Besides,thedensityfiltering(DF)algorithmisproposedtodiscardthenoisepulsesorclutter.Theperformanceofthealgorithmisevaluatedundertheeffectsofnoiseandmissingpulses.IthasbeenobservedthatthePSBRSalgorithmcancopewithalargenumberofnoisepulsesanditiscompletelyindependentofmissingpulses.Finally,PSBRSiscomparedwithsomebenchmarkalgorithms,andthesimulationresultsrevealthefeasibilityandefficiencyofthealgorithm.