On tuning a mean-field model for semi-supervised classification
Autor(a) principal: | |
---|---|
Data de Publicação: | 2022 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1088/1742-5468/ac6f02 http://hdl.handle.net/11449/240222 |
Resumo: | Semi-supervised learning (SSL) has become an interesting research area due to its capacity for learning in scenarios where both labeled and unlabeled data are available. In this work, we focus on the task of transduction-when the objective is to label all data presented to the learner-with a mean-field approximation to the Potts model. Aiming at this particular task we study how classification results depend on β and find that the optimal phase depends highly on the amount of labeled data available. In the same study, we also observe that more stable classifications regarding small fluctuations in β are related to configurations of high probability and propose a tuning approach based on such observation. This method relies on a novel parameter γ and we then evaluate two different values of the said quantity in comparison with classical methods in the field. This evaluation is conducted by changing the amount of labeled data available and the number of nearest neighbors in the similarity graph. Empirical results show that the tuning method is effective and allows NMF to outperform other approaches in datasets with fewer classes. In addition, one of the chosen values for γ also leads to results that are more resilient to changes in the number of neighbors, which might be of interest to practitioners in the field of SSL. |
id |
UNSP_949de0049344b6567cec1f7f1fffd93b |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/240222 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
On tuning a mean-field model for semi-supervised classificationinference of graphical modelsmachine learningmessage-passing algorithmsSemi-supervised learning (SSL) has become an interesting research area due to its capacity for learning in scenarios where both labeled and unlabeled data are available. In this work, we focus on the task of transduction-when the objective is to label all data presented to the learner-with a mean-field approximation to the Potts model. Aiming at this particular task we study how classification results depend on β and find that the optimal phase depends highly on the amount of labeled data available. In the same study, we also observe that more stable classifications regarding small fluctuations in β are related to configurations of high probability and propose a tuning approach based on such observation. This method relies on a novel parameter γ and we then evaluate two different values of the said quantity in comparison with classical methods in the field. This evaluation is conducted by changing the amount of labeled data available and the number of nearest neighbors in the similarity graph. Empirical results show that the tuning method is effective and allows NMF to outperform other approaches in datasets with fewer classes. In addition, one of the chosen values for γ also leads to results that are more resilient to changes in the number of neighbors, which might be of interest to practitioners in the field of SSL.Instituto De Geociências E Ciências Exatas/UNESP, Avenida 24A, State of São PauloInstituto De Geociências E Ciências Exatas/UNESP, Avenida 24A, State of São PauloUniversidade Estadual Paulista (UNESP)Bergamim, Emílio [UNESP]Breve, Fabricio [UNESP]2023-03-01T20:07:02Z2023-03-01T20:07:02Z2022-05-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://dx.doi.org/10.1088/1742-5468/ac6f02Journal of Statistical Mechanics: Theory and Experiment, v. 2022, n. 5, 2022.1742-5468http://hdl.handle.net/11449/24022210.1088/1742-5468/ac6f022-s2.0-85131693581Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengJournal of Statistical Mechanics: Theory and Experimentinfo:eu-repo/semantics/openAccess2023-03-01T20:07:02Zoai:repositorio.unesp.br:11449/240222Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T15:49:25.726729Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
On tuning a mean-field model for semi-supervised classification |
title |
On tuning a mean-field model for semi-supervised classification |
spellingShingle |
On tuning a mean-field model for semi-supervised classification Bergamim, Emílio [UNESP] inference of graphical models machine learning message-passing algorithms |
title_short |
On tuning a mean-field model for semi-supervised classification |
title_full |
On tuning a mean-field model for semi-supervised classification |
title_fullStr |
On tuning a mean-field model for semi-supervised classification |
title_full_unstemmed |
On tuning a mean-field model for semi-supervised classification |
title_sort |
On tuning a mean-field model for semi-supervised classification |
author |
Bergamim, Emílio [UNESP] |
author_facet |
Bergamim, Emílio [UNESP] Breve, Fabricio [UNESP] |
author_role |
author |
author2 |
Breve, Fabricio [UNESP] |
author2_role |
author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) |
dc.contributor.author.fl_str_mv |
Bergamim, Emílio [UNESP] Breve, Fabricio [UNESP] |
dc.subject.por.fl_str_mv |
inference of graphical models machine learning message-passing algorithms |
topic |
inference of graphical models machine learning message-passing algorithms |
description |
Semi-supervised learning (SSL) has become an interesting research area due to its capacity for learning in scenarios where both labeled and unlabeled data are available. In this work, we focus on the task of transduction-when the objective is to label all data presented to the learner-with a mean-field approximation to the Potts model. Aiming at this particular task we study how classification results depend on β and find that the optimal phase depends highly on the amount of labeled data available. In the same study, we also observe that more stable classifications regarding small fluctuations in β are related to configurations of high probability and propose a tuning approach based on such observation. This method relies on a novel parameter γ and we then evaluate two different values of the said quantity in comparison with classical methods in the field. This evaluation is conducted by changing the amount of labeled data available and the number of nearest neighbors in the similarity graph. Empirical results show that the tuning method is effective and allows NMF to outperform other approaches in datasets with fewer classes. In addition, one of the chosen values for γ also leads to results that are more resilient to changes in the number of neighbors, which might be of interest to practitioners in the field of SSL. |
publishDate |
2022 |
dc.date.none.fl_str_mv |
2022-05-01 2023-03-01T20:07:02Z 2023-03-01T20:07:02Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1088/1742-5468/ac6f02 Journal of Statistical Mechanics: Theory and Experiment, v. 2022, n. 5, 2022. 1742-5468 http://hdl.handle.net/11449/240222 10.1088/1742-5468/ac6f02 2-s2.0-85131693581 |
url |
http://dx.doi.org/10.1088/1742-5468/ac6f02 http://hdl.handle.net/11449/240222 |
identifier_str_mv |
Journal of Statistical Mechanics: Theory and Experiment, v. 2022, n. 5, 2022. 1742-5468 10.1088/1742-5468/ac6f02 2-s2.0-85131693581 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Journal of Statistical Mechanics: Theory and Experiment |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1808128567575314432 |