Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/67027
Citations
Scopus Web of Science® Altmetric
?
?
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShen, C.-
dc.contributor.authorWang, P.-
dc.contributor.authorShen, F.-
dc.contributor.authorWang, H.-
dc.date.issued2012-
dc.identifier.citationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012; 34(4):825-832-
dc.identifier.issn0162-8828-
dc.identifier.issn1939-3539-
dc.identifier.urihttp://hdl.handle.net/2440/67027-
dc.description.abstractIt has been shown that the Universum data, which do not belong to either class of the classification problem of interest, may contain useful prior domain knowledge for training a classifier [1], [2]. In this work, we design a novel boosting algorithm that takes advantage of the available Universum data, hence the name UBoost. UBoost is a boosting implementation of Vapnik’s alternative capacity concept to the large margin approach. In addition to the standard regularization term, UBoost also controls the learned model’s capacity by maximizing the number of observed contradictions. Our experiments demonstrate that UBoost can deliver improved classification accuracy over standard boosting algorithms that use labeled data alone.-
dc.description.statementofresponsibilityChunhua Shen, Peng Wang, Fumin Shen and Hanzi Wang-
dc.language.isoen-
dc.publisherIEEE Computer Soc-
dc.rightsCopyright 2012 IEEE-
dc.source.urihttp://dx.doi.org/10.1109/tpami.2011.240-
dc.subjectUniversum-
dc.subjectkernel methods-
dc.subjectboosting-
dc.subjectcolumn generation-
dc.subjectconvex optimization-
dc.titleUBoost: Boosting with the Universum-
dc.title.alternative{cal U}Boost: Boosting with the Universum-
dc.typeJournal article-
dc.identifier.doi10.1109/TPAMI.2011.240-
pubs.publication-statusPublished-
dc.identifier.orcidShen, C. [0000-0002-8648-8718]-
Appears in Collections:Aurora harvest
Computer Science publications

Files in This Item:
File Description SizeFormat 
hdl_67027.pdfAccepted version481.95 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.