You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/40484
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBreve, Fabricio Aparecido-
dc.contributor.authorZhao, Liang-
dc.date.accessioned2014-05-20T15:31:19Z-
dc.date.accessioned2016-10-25T18:07:06Z-
dc.date.available2014-05-20T15:31:19Z-
dc.date.available2016-10-25T18:07:06Z-
dc.date.issued2012-01-01-
dc.identifierhttp://dx.doi.org/10.1109/IJCNN.2012.6252617-
dc.identifier.citation2012 International Joint Conference on Neural Networks (ijcnn). New York: IEEE, p. 6, 2012.-
dc.identifier.issn1098-7576-
dc.identifier.urihttp://hdl.handle.net/11449/40484-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/40484-
dc.description.abstractConcept drift is a problem of increasing importance in machine learning and data mining. Data sets under analysis are no longer only static databases, but also data streams in which concepts and data distributions may not be stable over time. However, most learning algorithms produced so far are based on the assumption that data comes from a fixed distribution, so they are not suitable to handle concept drifts. Moreover, some concept drifts applications requires fast response, which means an algorithm must always be (re) trained with the latest available data. But the process of labeling data is usually expensive and/or time consuming when compared to unlabeled data acquisition, thus only a small fraction of the incoming data may be effectively labeled. Semi-supervised learning methods may help in this scenario, as they use both labeled and unlabeled data in the training process. However, most of them are also based on the assumption that the data is static. Therefore, semi-supervised learning with concept drifts is still an open challenge in machine learning. Recently, a particle competition and cooperation approach was used to realize graph-based semi-supervised learning from static data. In this paper, we extend that approach to handle data streams and concept drift. The result is a passive algorithm using a single classifier, which naturally adapts to concept changes, without any explicit drift detection mechanism. Its built-in mechanisms provide a natural way of learning from new data, gradually forgetting older knowledge as older labeled data items became less influent on the classification of newer data items. Some computer simulation are presented, showing the effectiveness of the proposed method.en
dc.format.extent6-
dc.language.isoeng-
dc.publisherIEEE-
dc.sourceWeb of Science-
dc.subjectConcept Driften
dc.subjectSemi-Supervised Learningen
dc.subjectParticle Competition and Cooperationen
dc.subjectMachine learningen
dc.titleParticle Competition and Cooperation in Networks for Semi-Supervised Learning with Concept Driften
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationSão Paulo State Univ UNESP, São Paulo, Brazil-
dc.description.affiliationUnespSão Paulo State Univ UNESP, São Paulo, Brazil-
dc.identifier.doi10.1109/IJCNN.2012.6252617-
dc.identifier.wosWOS:000309341301117-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartof2012 International Joint Conference on Neural Networks (ijcnn)-
dc.identifier.scopus2-s2.0-84865065341-
dc.identifier.orcid0000-0002-1123-9784pt
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

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