Particle competition and cooperation for semi-supervised learning with label noise

Autor(es)

Breve, Fabricio A. ^[1] ; Zhao, Liang ^[2] ; Quiles, Marcos G. ^[3]

Afiliação do(s) autor(es)

^[1] Sao Paulo State Univ UNESP, Inst Geosci & Exact Sci IGCE, Dept Stat Appl Math & Computat DEMAC, BR-13506900 Sao Paulo - Brazil

^[2] Univ Sao Paulo, Sch Philosophy Sci & Literature Ribeirao Preto FF, Dept Comp Sci & Math DCM, BR-14040900 Sao Paulo - Brazil

^[3] Fed Univ Sao Paulo Unifesp, Inst Sci & Technol ICT, Sao Jose Dos Campos, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: Neurocomputing; v. 160, p. 63-72, JUL 21 2015.
• Citações Web of Science: 5

Resumo

Semi-supervised learning methods are usually employed in the classification of data sets where only a small subset of the data items is labeled. In these scenarios, label noise is a crucial issue, since the noise may easily spread to a large portion or even the entire data set, leading to major degradation in classification accuracy. Therefore, the development of new techniques to reduce the nasty effects of label noise in semi-supervised learning is a vital issue. Recently, a graph-based semi-supervised learning approach based on particle competition and cooperation was developed. In this model, particles walk in the graphs constructed from the data sets. Competition takes place among particles representing different class labels, while the cooperation occurs among particles with the same label. This paper presents a new particle competition and cooperation algorithm, specifically designed to increase the robustness to the presence of label noise, improving its label noise tolerance. Different from other methods, the proposed one does not require a separate technique to deal with label noise. It performs classification of unlabeled nodes and reclassification of the nodes affected by label noise in a unique process. Computer simulations show the classification accuracy of the proposed method when applied to some artificial and real-world data sets, in which we introduce increasing amounts of label noise. The classification accuracy is compared to those achieved by previous particle competition and cooperation algorithms and other representative graph-based semi-supervised learning methods using the same scenarios. Results show the effectiveness of the proposed method. (C) 2015 Elsevier B.V. All rights reserved. (AU)

• Processo FAPESP: 11/50151-0 - Fenômenos dinâmicos em redes complexas: fundamentos e aplicações
• Beneficiário: Elbert Einstein Nehrer Macau
• Linha de fomento: Auxílio à Pesquisa - Temático
• Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
• Beneficiário: José Alberto Cuminato
• Linha de fomento: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
• Processo FAPESP: 11/17396-9 - Aprendizado de máquina utilizando modelos inspirados pela natureza
• Beneficiário: Fabricio Aparecido Breve
• Linha de fomento: Auxílio à Pesquisa - Apoio a Jovens Pesquisadores
• Processo FAPESP: 11/18496-7 - Aprendizado semi-supervisionado dinâmico e ativo baseado em redes complexas
• Beneficiário: Marcos Gonçalves Quiles
• Linha de fomento: Auxílio à Pesquisa - Apoio a Jovens Pesquisadores