OALib Journal期刊
ISSN: 2333-9721
费用:99美元
|
|
|
基于属性最大间隔的子空间聚类
DOI: 10.13232/j.cnki.jnju.2014.04.013
Keywords: 空间聚类,最大间隔,最大间隔子空间聚类
Abstract:
?子空间聚类能有效的发现各簇与所属于的子空间的联系,同时减少高维数据中因为数据冗余和不相关属性对聚类过程产生的干扰。已有的子空间聚类方法强调各子空间中簇的发现,往往忽略子空间的划分。提出了基于属性最大间隔的子空间聚类,该方法主要思想是对子空间的划分时信息的丢失达到最小,从而子空间聚类的结果的效果比较好。主要工作包括:第一,建立了子空间划分的目标函数,也就是使各划分的子空间相互依赖达到最小,第二,设计了基于属性最大间隔的子空间聚类算法maximummarginsubspaceclustering(mmsc)进行子空间聚类集成。最后,采用uci和nips2003比赛等数据来做实验,结果表明,在大多数数据上mmsc算法比其他子空间算法能得到更好的聚类结果。
References
[1] | verleysenm.learninghigh-dimensionaldata.in:ablameykos,gorasl,gorim,etal.proceedingsofthelimitationsandfuturetrendsinneuralcomputation.siena:iospress,2003:141~162.
|
[2] | parsonsl,haquee,liuh.subspaceclusteringingforhighdimensionaldata:areview.acmsigkddexplorationsnewsletter,2004,6(1):90~105.
|
[3] | agrawalr,gehrkej,gunopulosd,etal.automaticsubspaceclusteringingofhighdimensionaldatafordataminingapplications.in:proceedingsoftheacminternationalconferenceonmanagementofdata(sigmod).newyork:acmpress,1998,27(2):94~105.
|
[4] | chengch,fuaw,zhangy.entropy-basedsubspaceclusteringingforminingnumericaldata.in:proceedingsofthe5thacmsigkddinternationalconferenceonknowledgediscoveryanddatamining.newyork:acmpress,1999:84~93.
|
[5] | goils,nageshh,choudharya.mafia:efficientandscalablesubspaceclusteringingforverylargedatasets.technicalreportcpdc-tr-9906-010,northwesternuniversity,1999.
|
[6] | nageshhs.highperformancesubspaceclusteringingformassivedatasets.master’sthesis,northwesternuniversity,1999.
|
[7] | nageshhs,goils,choudharya.ascalableparallelsubspaceclusteringingalgorithmformassivedatasets.in:proceedingsofthe2000internationalconferenceonparallelprocessing.toronto:ieeepress.2000:477~484.
|
[8] | changjw,jinds.anewcell-basedclusteringmethodforlarge,high-dimensionaldataindataminingapplications.in:proceedingsofthe2002acmsymposiumonappliedcomputing.newyork:acmpress,2002,503~507.
|
[9] | liub,xiay,yups.clusteringthroughdecisiontreeconstruction.in:proceedingsofthe9thinternationalconferenceoninformationandknowledgemanagement.newyork:acmpress,2000:20~29.
|
[10] | procopiuccm,jonesm,agarwalpk,etal.amontecarloalgorithmforfastprojectiveclustering.in:proceedingsofthe2002acmsigmodinternationalconferenceonmanagementofdata.newyork:acmpress,2002:418~427.
|
[11] | aggarwalc,wolfjl,yups,etal.fastalgorithmsforprojectedclustering.in:proceedingsofthe1999acmsigmodinternationalconferenceonmanagementofdata.newyork:acmpress,1999,28(2):61~72.
|
[12] | aggarwalc,yups.findinggeneralizedprojectedclustersinhighdimensionalspaces.in:proceedingsofthe2000acmsigmodinternationalconferenceonmanagementofdata.newyork:acmpress,2000,29(2):70~81.
|
[13] | wookg,leejh.findit:afastandintelligentsubspaceclusteringingalgorithmusingdimensionvoting.informationandsoftwaretechnology,2004,46(4):255~271.
|
[14] | gullof,domeniconic,tagarellia.enhancingsingle-objectiveprojectiveclusteringensembles.in:proceedingsoftheieee10thinternationalconferenceondatamining(icdm).sydney:ieeepress,2010,833~838.
|
[15] | gullof,domeniconic,tagarellia.advancingdataclusteringviaprojectiveclusteringensembles.in:proceedingsofthe2011acmsigmodinternationalconferenceonmanagementofdata.newyork:acmpress,2011:733~744.
|
[16] | reshefdn,reshefya,finucanehk,etal.detectingnovelassociationsinlargedatasets.science,2011,334(6062):1518~1524.
|
[17] | zhouzh,tangw.clusterensemble.knowledge-basedsystems,2006,19(1):77~83.
|
[18] | garclas,fernndeza,luengoj,etal.advancednonparametrictestsformultiplecomparisonsinthedesignofexperimentsincomputationalintelligenceanddatamining:experimentalanalysisofpower.informationsciences,2010,180:2044~2064.
|
[19] | yangj,wangw,wanghx,etal.-clusters:capturingsubspacecorrelationinalargedataset.in:proceedingsofthe18thinternationalconferenceondataengineering.sanjose:ieeepress,2002:517~528.
|
[20] | friedmanjh,meulmanj.clusteringobjectsonsubsetsofattributes.journaloftheroyalstatisticsociety,2004,66(4):815~849.
|
[21] | wangd,dingc,lit.k-subspaceclusteringing.machinelearningandknowledgediscoveryindatabases.slovenia:springerberlinheidelberg,2009,506~521.
|
[22] | mullere,assenti,gunnemanns,etal.relevantsubspaceclustering:miningthemostinterestingnon-redundantconceptsinhighdimensionaldata.in:proceedingoftheieee9thinternationalconferenceondatamining.miami:ieeepress,2009:377~386.
|
[23] | kriegelhp,krogerp,renzm,etal.agenericframeworkforefficientsubspaceclusteringingofhigh-dimensionaldata.in:proceedingsoftheieee5thinternationalconferenceondatamining.houston:ieeepress,2005:8.
|
[24] | moiseg,sanderj,esterm.p3c:arobustprojectedclusteringalgorithm.in:proceedingsoftheieee6thinternationalconferenceondatamining.hongkong:ieeepress,2006:414~425.
|
[25] | gullof,domeniconic,tagarellia.projectiveclusteringensembles.in:proceedingsoftheieee9thinternationalconferenceondatamining(icdm).miami:ieeepress,2009:794~799.
|
Full-Text
|
|
Contact Us
service@oalib.com QQ:3279437679 
WhatsApp +8615387084133
|
|