efficient online spherical k-means clusteringnew

efficient online spherical k-means clusteringnew

ID:34471972

大小:115.10 KB

页数:6页

时间:2019-03-06

efficient online spherical k-means clusteringnew_第1页
efficient online spherical k-means clusteringnew_第2页
efficient online spherical k-means clusteringnew_第3页
efficient online spherical k-means clusteringnew_第4页
efficient online spherical k-means clusteringnew_第5页
资源描述:

《efficient online spherical k-means clusteringnew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、EfficientOnlineSphericalK-meansClusteringShiZhongDepartmentofComputerScienceandEngineeringFloridaAtlanticUniversity,BocaRaton,FL33431Email:zhong@cse.fau.eduAbstract—Thesphericalk-meansalgorithm,i.e.,thek-meansOurmainobjectiveinthispaperistosignificantlyimprovealgorithmwit

2、hcosinesimilarity,isapopularmethodforcluster-theclusteringqualityfork-means,yettoretainitsefficiency.inghigh-dimensionaltextdata.Inthisalgorithm,eachdocumentAtraditionalwayofimprovingthequalityofk-meansistoaswellaseachclustermeanisrepresentedasahigh-dimensionalemploybett

3、eroptimization(annealing)techniques(e.g.,[4],unit-lengthvector.However,ithasbeenmainlyusedinbatchmode.Thatis,eachclustermeanvectorisupdated,onlyafter[5])toavoid(bad)localoptima.However,thesemethodsarealldocumentvectorsbeingassigned,asthe(normalized)averageusuallytootime

4、-consumingtobevaluableinpractice.Localofallthedocumentvectorsassignedtothatcluster.Thispapersearchwasusedin[6]toimprovetheobjectivefunctionvalueinvestigatesanonlineversionofthesphericalk-meansalgorithmforsphericalk-means.Thealgorithmtriestofindadatapoint,basedonthewell-k

5、nownWinner-Take-Allcompetitivelearning.andbyswitchingittoadifferentcluster,toimprovetheInthisonlinealgorithm,eachclustercentroidisincrementallyupdatedgivenadocument.Wedemonstratethattheonlinesphericalk-meansobjectivefunction.Thisapproach,however,sphericalk-meansalgorith

6、mcanachievesignificantlybetterworksfavorablyonlyforsmalltextdatasets.Forlargeclusters,clusteringresultsthanthebatchversion,especiallywhenanthe“firstvariation”techniqueisunlikelytobeeffective,annealing-typelearningratescheduleisused.Wealsopresentasadmittedin[6].Inaddition,

7、theproposedlocalsearchheuristicstoimprovethespeed,yetalmostwithoutlossofalgorithmseemstobecomputationallycostlyforclusteringclusteringquality.largetextdatasets.I.INTRODUCTIONAnotherapproachistoreplacethebatchupdateofclusterDocumentclusteringhasbecomeanincreasinglyimport

8、antcentroidsbyanonlinelearningstrategy.Thestandardk-meanstechniqueforunsuperviseddocumentorganization,automati

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

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

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