全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

全粒度聚类算法

DOI: 10.13232/j.cnki.jnju.2014.04.015

Keywords: 相似性度量,聚类分析,全粒度

Full-Text   Cite this paper   Add to My Lib

Abstract:

聚类分析是数据挖掘与知识发现领域的一个重要研究方向。多数聚类算法中相似性是其核心概念之一,对象之间的相似性会被直接或者间接的计算出来。传统的相似性度量方法多是基于单一的粒度去观察两个被测对象。在人类认知过程中,通常采用多粒度来更合理有效地进行问题求解。本文借鉴人类的这种多粒度认知机理,提出一种新的相似性学习方法,称作全粒度相似性度量方法,基于此发展了一种全粒度聚类算法。而全粒度相似性度量从各个角度观察被测对象,进而会得到两个对象间更加真实的相似度。从uci数据集中选取5组数据进行实验,最后通过与两种传统的聚类方法比较验证了全粒度聚类算法的合理性与有效性。

References

[1]  guhas,rastogir,shimk.cure:arobustclusteringalgorithmforcategoricalattributes.in:proceedingsofthe15thinternationalconferenceondataengineering,sydney,australia,ieeecomputersociety,1999:512~521.
[2]  karypisg,haneh,kumarv.chameleon:ahierarchicalclusteringalgorithmusingdynamicmodeling.ieeecomputer,1999,32(8):68~75.
[3]  hinneburga,keimd.anefficientapproachtoclusteringlargemultimediadatabaseswithnoise.in:proceedingsofthe4thacmsigkdd,newyork,ny,september,1998,58~65.
[4]  wangw,yangj,muntzr.stng+:anapproachtoactivespatialdatamining.in:proceedingsofthe15thicde,sydney,ieeecomputersociety,1999:116~125.
[5]  agrawalr,gehrkej,gunopulosd.automaticsubspaceclusteringofhighdimensionaldatafordataminingapplications.in:proceedingsoftheacmsigmodconference,seattle,springerverlag,kluweracademicpublishers,1998:94~105.
[6]  chrisd.atutorialonspectralclustering.in:proceedingsoftheinternationalconferenceofmachinelearning,banff,springerus,2004:395-416.
[7]  kriegelhp,krogerp,zimeka.clusteringhigh-dimensionaldata:asurveyonsubspaceclustering,pattern-basedclustering,andcorrelationclustering.acmtransactiononknowledgediscoveryfromdata,2009,3(1):1~58.
[8]  guyoni,luxburguv,williamsonrc.clustering:scienceorart?technicalreport,nips2009workshopclustering:scienceorart?vancouver,canada,2009.
[9]  qiany,liangj,dangc.incompletemultigranulationroughset.ieeetransactionsonsystems,manandcybernetics-parta,2010,40(2):420~431.
[10]  qiany,liangj,yaoy,etal.mgrs:amulti-granulationroughset.informationsciences,2010,180:949~970.
[11]  qiany,liangj,witoldp,etal.positiveapproximation:anacceleratorforattributereductioninroughsettheory.artificialintelligence,2010,174:597~618.
[12]  qiany,liangj,wuw,etal.informationgranularityinfuzzybinarygrcmodel.ieeetransactionsonfuzzysystems,2011,19(2):253~264.
[13]  dhilloni,modhad.conceptdecompositionsforlargesparsetextdatausingclustering.machinelearning,2001,42(1/2):143~175.
[14]  guhas,rastogir,shimk.cure:anefficientclusteringalgorithmforlargedatabases.in:proceedingsoftheacmsigmodconference,seattle,1998:73~84.
[15]  esterm,kriegelhp,sanderj.adensity-basedalgorithmfordiscoveringclusterinlargespatialdatabaseswithnoise.in:proceedingsofthe2ndacmsigkdd,portland,aaaipress,1996:226~231.
[16]  wangw,yangj,muntzr.stng:astatisticalinformationgridapproachtospatialdataminging.in:proceedingsofthe23rdconferenceonvldb,athens,morgankaufmann,1997:186~195.
[17]  dhilloni.co-clusteringdocumentsandwordsusingbipartitespectralpathpartitioning.in:proceedingsofthe7thacmsigkdd,newyork,acmpress,1999:73~83.
[18]  wux,kumarv,quinlanjr,etal.top10algorithmsindatamining.knowledgeinformationsystems,2007,14(1):1~37.
[19]  linty.granularcomputing.announcementofthebiscspecialinterestgroupongranularcomputing,1997.
[20]  ducthangnguyen,chenlh,cheekeongchan.clusteringwithmultiviewpoint-basedsimilaritymeasure.ieeetransactionsonknowledgeanddataengineering,2012,24(6):988~1001.
[21]  leed,leej.dynamicdissimilaritymeasureforsupportbasedclustering.ieeetransactionsonknowledgeanddataengineering,2010,22(6):900~905.
[22]  strehla,ghoshj,mooneyr.impactofsimilaritymeasuresonweb-pageclustering.in:proceedingsofthe17thinternationalconferenceonartificialintelligence:workshopofartificialintelligenceforwebsearch(aaai),2000:58~64.
[23]  huangzx.extensionstothek-meansalgorithmforclusteringlargedatasetswithcategoricalvalues.dataminingandknowledgediscovery,1998,2(3):283~304.
[24]  manningcd,raghavanp,schutzeh.anintroductiontoinformationretrieval.unitedkingdom,cambridgeuniversitypress,2009:496.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133