File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Budget semi-supervised learning

TitleBudget semi-supervised learning
Authors
Issue Date2009
PublisherSpringer.
Citation
13th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2009), Bangkok, Thailand, 27-30 April 2009. In Advances in Knowledge Discovery and Data Mining: 13th Pacific-Asia Conference, PAKDD 2009 Bangkok, Thailand, April 27-30, 2009: Proceedings, 2009, p. 588-595 How to Cite?
AbstractIn this paper we propose to study budget semi-supervised learning,i.e., semi-supervised learning with a resource budget, such as a limited memory insufficient to accommodate and/or process all available unlabeled data. This setting is with practical importance because in most real scenarios although there may exist abundant unlabeled data, the computational resource that can be used is generally not unlimited. Effective budget semi-supervised learning algorithms should be able to adjust behaviors considering the given resource budget. Roughly,the more resource, the more exploitation on unlabeled data. As an example, in this paper we show that this is achievable by a simple yet effective method. © Springer-Verlag Berlin Heidelberg 2009.
Persistent Identifierhttp://hdl.handle.net/10722/276841
ISBN
ISSN
2023 SCImago Journal Rankings: 0.606
Series/Report no.Lecture Notes in Computer Science ; 5476

 

DC FieldValueLanguage
dc.contributor.authorZhi-Hua, Zhou-
dc.contributor.authorMichael, Ng-
dc.contributor.authorQiao-Qiao, She-
dc.contributor.authorYuan, Jiang-
dc.date.accessioned2019-09-18T08:34:49Z-
dc.date.available2019-09-18T08:34:49Z-
dc.date.issued2009-
dc.identifier.citation13th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2009), Bangkok, Thailand, 27-30 April 2009. In Advances in Knowledge Discovery and Data Mining: 13th Pacific-Asia Conference, PAKDD 2009 Bangkok, Thailand, April 27-30, 2009: Proceedings, 2009, p. 588-595-
dc.identifier.isbn9783642013065-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/276841-
dc.description.abstractIn this paper we propose to study budget semi-supervised learning,i.e., semi-supervised learning with a resource budget, such as a limited memory insufficient to accommodate and/or process all available unlabeled data. This setting is with practical importance because in most real scenarios although there may exist abundant unlabeled data, the computational resource that can be used is generally not unlimited. Effective budget semi-supervised learning algorithms should be able to adjust behaviors considering the given resource budget. Roughly,the more resource, the more exploitation on unlabeled data. As an example, in this paper we show that this is achievable by a simple yet effective method. © Springer-Verlag Berlin Heidelberg 2009.-
dc.languageeng-
dc.publisherSpringer.-
dc.relation.ispartofAdvances in Knowledge Discovery and Data Mining: 13th Pacific-Asia Conference, PAKDD 2009 Bangkok, Thailand, April 27-30, 2009: Proceedings-
dc.relation.ispartofseriesLecture Notes in Computer Science ; 5476-
dc.titleBudget semi-supervised learning-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-01307-2_57-
dc.identifier.scopuseid_2-s2.0-67650656582-
dc.identifier.spage588-
dc.identifier.epage595-
dc.identifier.eissn1611-3349-
dc.publisher.placeBerlin-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats