... support vector onlyneedtodescribethedatawithknowncategory,thendomainclassifer(SVDC),thenanincremental learning obtainingthedescriptionboundaryofthisclassofdata.algorithmbasedonSVDCwasproposed.ThebasicideaofFinally,wecanclassifytheunknownbinary-classdatathisincrementalalgorithmistoobtaintheinitialtargetaccordingtotheobtainedboundary.conceptsusingSVDCduringthetrainingprocedure and thenInthispaperourincremental learning algorithmisbasedupdatethesetargetconceptsbyanupdatingmodel.DifierentonSVDC, and thisalgorithmismotivatedbythefromtheexistedincremental learning approaches,inourperson -learning procedure.When learning acomplicatedalgorithm,themodelupdatingprocedureequalstosolveaconcept,peopleusuallyobtainainitialconceptbyusingpartquadraticprogramming(QP)problem, and theupdatedmodelofusefulinformation,thenupdatetheobtainedconceptbystillownsthepropertyofsparssolution.Comparedwithotherutilizingnewinformation.Intermofourincrementalexistedincrementallearningalgorithms,theinverseprocedurealgorithmbasedonSVDC,itfirstlyutilizepartofdataofouralgorithm(i.e.decreasing learning) iseasytoconduct(memoryspacepermitting),thenobtainaconcept(namelythewithoutextracomputation.Experimentresultsshowourparameterofobtaineddecisionhypersurface)bySVDCalgorithmiseffectiveandfeasible. learning algorithm,finallyaccordingtotheinformationofdecisionhypersurfaceacquiredinlaststep,updatetheparameterofdecisionhypersurfacegainedinlaststeputilizingKeywords: Support Vector Machines, Support Vector DomainspecializedupdatingmodelintheprocessofincrementalClassifier,Incremental learning, Classification. learning, namelyupdatingtheknownconcept.Ouralgorithmownsthefollowingcharacters:1.INTRODUCTION1)TheincrementalupdatingmodelinthisalgorithmWithlargeamountsofdataavailabletomachine learning hasasimilarmathematicsformcomparedwithcommunity,theneedtodesigntechniquesthatscalewellisstandardSVDCalgorithm, and anyalgorithmusedmorecriticalthanbefore.AssomedatamaybecollectedovertoobtainthestandardSVDCcanalsobeusedtolongperiods,thereisalsoacontinuousneedtoincorporatetheobtaintheupdatingmodelofouralgorithm;newdataintothepreviouslylearnedconcept.Incremental2)Theinverseprocedureofthisalgorithm,i.e.the learning techniquescansatisfytheneedforboththescalabilitydecreasing learning procedureiseasyto and incrementalupdate.implement,thatistosaywhenweperceivethe Support vector machine(SVM)isbasedonstatisticalgeneralizationperformancedroppedinthe learning theory,whichhasdevelopedoverlastthreedecadesincrementalprocess,wecaneasilyreturnlaststep[1,2].Ithasbeenprovenverysuccessfulinmanyapplicationswithoutextracomputation;[3,4,5,6].SVMisasupervisedbinary-classclassifier,whenTheexperimentalresultsshowthe learning performancewetrainsamplesusingSVM,thecategoriesofthesamplesareofthisalgorithmapproachesthatofbatchtraining, and neededtobeknown.However,inmanycases,itisrarethatperformancewellinlarge-scaledatasetcomparedtootherwecanobtainthedatawiththeircategorybeknown,inotherSVDCincremental learning algorithm.words,mostoftheobtaineddata'scategoriesareunknown.InTherestofthispaperisorganizedasfollows.Insection2thissituation,traditionalSVMisn'tappropriate.wegiveanintroductionofSVDC, and insection3wepresentTAXetalproposedamethodfordatadomaindescriptionourincrementalalgorithm.Experimental and resultscalled support vector domaindescription(SVDD)[7], and itisconcerningtheproposedalgorithmareofferedinSection4.usedtodescribedatadomain and deleteoutliers.ThekeyideaSection5collectsthemainconclusions.OfSVDDistodescribeoneclassofdatabyfindingaspherewithminimumvolume,whichcontainsthisclassofdata.Proc.5thIEEEInt.Conf.onCognitiveInformatics(ICCI'06)Y.Y.Yao,Z.Z.Shi,Y.Wang, and W.Kinsner(Eds.)801-4244-0475-4/06/$20.OO@2006IEEE802. Support Vector DomainClassifierwithconstrains,==1, and 0<a,<C.Wherethe2.1 Support Vector DomainDescription[7]innerproducthasbeenreplacedwith kernel functionK(.,.), and K(.,.)isadefinite kernel satisfyingmercerOfadatasetcontaiingNdataobjcondition,forexampleapopularchoiceistheGaussianOfadatasetcontainingNdataobjects,enl(,)=ep-xz2/2),>0fx,Z=1, ... support vector onlyneedtodescribethedatawithknowncategory,thendomainclassifer(SVDC),thenanincremental learning obtainingthedescriptionboundaryofthisclassofdata.algorithmbasedonSVDCwasproposed.ThebasicideaofFinally,wecanclassifytheunknownbinary-classdatathisincrementalalgorithmistoobtaintheinitialtargetaccordingtotheobtainedboundary.conceptsusingSVDCduringthetrainingprocedure and thenInthispaperourincremental learning algorithmisbasedupdatethesetargetconceptsbyanupdatingmodel.DifierentonSVDC, and thisalgorithmismotivatedbythefromtheexistedincremental learning approaches,inourperson -learning procedure.When learning acomplicatedalgorithm,themodelupdatingprocedureequalstosolveaconcept,peopleusuallyobtainainitialconceptbyusingpartquadraticprogramming(QP)problem, and theupdatedmodelofusefulinformation,thenupdatetheobtainedconceptbystillownsthepropertyofsparssolution.Comparedwithotherutilizingnewinformation.Intermofourincrementalexistedincrementallearningalgorithms,theinverseprocedurealgorithmbasedonSVDC,itfirstlyutilizepartofdataofouralgorithm(i.e.decreasing learning) iseasytoconduct(memoryspacepermitting),thenobtainaconcept(namelythewithoutextracomputation.Experimentresultsshowourparameterofobtaineddecisionhypersurface)bySVDCalgorithmiseffectiveandfeasible. learning algorithm,finallyaccordingtotheinformationofdecisionhypersurfaceacquiredinlaststep,updatetheparameterofdecisionhypersurfacegainedinlaststeputilizingKeywords: Support Vector Machines, Support Vector DomainspecializedupdatingmodelintheprocessofincrementalClassifier,Incremental learning, Classification. learning, namelyupdatingtheknownconcept.Ouralgorithmownsthefollowingcharacters:1.INTRODUCTION1)TheincrementalupdatingmodelinthisalgorithmWithlargeamountsofdataavailabletomachine learning hasasimilarmathematicsformcomparedwithcommunity,theneedtodesigntechniquesthatscalewellisstandardSVDCalgorithm, and anyalgorithmusedmorecriticalthanbefore.AssomedatamaybecollectedovertoobtainthestandardSVDCcanalsobeusedtolongperiods,thereisalsoacontinuousneedtoincorporatetheobtaintheupdatingmodelofouralgorithm;newdataintothepreviouslylearnedconcept.Incremental2)Theinverseprocedureofthisalgorithm,i.e.the learning techniquescansatisfytheneedforboththescalabilitydecreasing learning procedureiseasyto and incrementalupdate.implement,thatistosaywhenweperceivethe Support vector machine(SVM)isbasedonstatisticalgeneralizationperformancedroppedinthe learning theory,whichhasdevelopedoverlastthreedecadesincrementalprocess,wecaneasilyreturnlaststep[1,2].Ithasbeenprovenverysuccessfulinmanyapplicationswithoutextracomputation;[3,4,5,6].SVMisasupervisedbinary-classclassifier,whenTheexperimentalresultsshowthe learning performancewetrainsamplesusingSVM,thecategoriesofthesamplesareofthisalgorithmapproachesthatofbatchtraining, and neededtobeknown.However,inmanycases,itisrarethatperformancewellinlarge-scaledatasetcomparedtootherwecanobtainthedatawiththeircategorybeknown,inotherSVDCincremental learning algorithm.words,mostoftheobtaineddata'scategoriesareunknown.InTherestofthispaperisorganizedasfollows.Insection2thissituation,traditionalSVMisn'tappropriate.wegiveanintroductionofSVDC, and insection3wepresentTAXetalproposedamethodfordatadomaindescriptionourincrementalalgorithm.Experimental and resultscalled support vector domaindescription(SVDD)[7], and itisconcerningtheproposedalgorithmareofferedinSection4.usedtodescribedatadomain and deleteoutliers.ThekeyideaSection5collectsthemainconclusions.OfSVDDistodescribeoneclassofdatabyfindingaspherewithminimumvolume,whichcontainsthisclassofdata.Proc.5thIEEEInt.Conf.onCognitiveInformatics(ICCI'06)Y.Y.Yao,Z.Z.Shi,Y.Wang, and W.Kinsner(Eds.)801-4244-0475-4/06/$20.OO@2006IEEE802. Support Vector DomainClassifierwithconstrains,==1, and 0<a,<C.Wherethe2.1 Support Vector DomainDescription[7]innerproducthasbeenreplacedwith kernel functionK(.,.), and K(.,.)isadefinite kernel satisfyingmercerOfadatasetcontaiingNdataobjcondition,forexampleapopularchoiceistheGaussianOfadatasetcontainingNdataobjects,enl(,)=ep-xz2/2),>0fx,Z=1, ... ,~NJ}adescriptioniSrequired.Wetrytofindakre:Kxz=pJ1X_12221a>.{xs,ind1.,}acdscprequreeWwtrtindmaTodeterminewhetheratestpointiszwithintheclosed and compactsphereareaQwithminimumsphere,thedistancetothecenterofthespherehastobevolume,whichcontainall(ormostof)theneededobjectscalculated.AtestobjectzacceptedwhenthisdistanceisQ, and theoutliersareoutsideQ.Figure1showsthesmallthantheradius,i.e.,when(z-a)T(z-a)<R2.sketchof Support Vector DomainDescription(SVDD).Expressingthecenterofthesphereintermofthe support support vector vector,weacceptobjectswhenZ-a2=K(z,z) 2aiK(xz)+ZEaiaK(x1,xj)R2ijoutliersag6jc(5+cassiicationbo.urdary2.2 Support Vector DomainClassifier0O'*++...