[NIPS 2011] Learning Anchor Planes for Classification

[NIPS 2011] Learning Anchor Planes for Classification

ID:40254148

大小:803.75 KB

页数:9页

时间:2019-07-29

[NIPS 2011] Learning Anchor Planes for Classification_第1页
[NIPS 2011] Learning Anchor Planes for Classification_第2页
[NIPS 2011] Learning Anchor Planes for Classification_第3页
[NIPS 2011] Learning Anchor Planes for Classification_第4页
[NIPS 2011] Learning Anchor Planes for Classification_第5页
资源描述:

《[NIPS 2011] Learning Anchor Planes for Classification》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、LearningAnchorPlanesforClassificationyzyyxZimingZhangL’uborLadickýPhilipH.S.TorrAmirSaffariyDepartmentofComputing,OxfordBrookesUniversity,Wheatley,Oxford,OX331HX,U.K.zDepartmentofEngineeringScience,UniversityofOxford,ParksRoad,Oxford,OX13PJ,U.K.xSonyComputerEntert

2、ainmentEurope,London,UK{ziming.zhang,philiptorr}@brookes.ac.uklubor@robots.ox.ac.ukamir@ymer.orgAbstractLocalCoordinateCoding(LCC)[18]isamethodformodelingfunctionsofdatalyingonnon-linearmanifolds.Itprovidesasetofanchorpointswhichformalocalcoordinatesystem,suchtha

3、teachdatapointonthemanifoldcanbeapproximatedbyalinearcombinationofitsanchorpoints,andthelinearweightsbecomethelocalcoordinatecoding.Inthispaperweproposeencodingdatausingorthogonalanchorplanes,ratherthananchorpoints.Ourmethodneedsonlyafeworthogonalanchorplanesforc

4、oding,anditcanlinearizeany( ; ;p)-Lipschitzsmoothnon-linearfunctionwithafixedexpectedvalueoftheupper-boundapproximationerroronanyhighdimensionaldata.Inpractice,theorthogonalcoordinatesystemcanbeeasilylearnedbyminimizingthisupperboundusingsingularvaluedecomposition

5、(SVD).WeapplyourmethodtomodelthecoordinateslocallyinlinearSVMsforclassificationtasks,andourexperimentonMNISTshowsthatusingonly50anchorplanesourmethodachieves1.72%errorrate,whileLCCachieves1.90%errorrateusing4096anchorpoints.1IntroductionLocalCoordinateCoding(LCC)[

6、18]isacodingschemethatencodesthedatalocallysothatanynon-linear( ; ;p)-Lipschitzsmoothfunction(seeDefinition1inSection2fordetails)overthedatamanifoldcanbeapproximatedusinglinearfunctions.Therearetwocomponentsinthismethod:(1)asetofanchorpointswhichdecidethelocalcoor

7、dinates,and(2)thecodingforeachdatabasedonthelocalcoordinatesgiventheanchorpoints.Theoretically[18]suggeststhatundercertainassumptions,localityismoreessentialthansparsityfornon-linearfunctionapproximation.LCChasbeensuccessfullyappliedtomanyapplicationssuchlikeobje

8、ctrecognition(e.g.locality-constraintlinearcoding(LLC)[16])inVOC2009challenge[7].OnebigissueinLCCisthatitsclassificationperformanceishighlydependentonthenumbero

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

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

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