Cargando…
A fast combination method in DSmT and its application to recommender system
In many applications involving epistemic uncertainties usually modeled by belief functions, it is often necessary to approximate general (non-Bayesian) basic belief assignments (BBAs) to subjective probabilities (called Bayesian BBAs). This necessity occurs if one needs to embed the fusion result in...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5774721/ https://www.ncbi.nlm.nih.gov/pubmed/29351297 http://dx.doi.org/10.1371/journal.pone.0189703 |
_version_ | 1783293795148759040 |
---|---|
author | Dong, Yilin Li, Xinde Liu, Yihai |
author_facet | Dong, Yilin Li, Xinde Liu, Yihai |
author_sort | Dong, Yilin |
collection | PubMed |
description | In many applications involving epistemic uncertainties usually modeled by belief functions, it is often necessary to approximate general (non-Bayesian) basic belief assignments (BBAs) to subjective probabilities (called Bayesian BBAs). This necessity occurs if one needs to embed the fusion result in a system based on the probabilistic framework and Bayesian inference (e.g. tracking systems), or if one needs to make a decision in the decision making problems. In this paper, we present a new fast combination method, called modified rigid coarsening (MRC), to obtain the final Bayesian BBAs based on hierarchical decomposition (coarsening) of the frame of discernment. Regarding this method, focal elements with probabilities are coarsened efficiently to reduce computational complexity in the process of combination by using disagreement vector and a simple dichotomous approach. In order to prove the practicality of our approach, this new approach is applied to combine users’ soft preferences in recommender systems (RSs). Additionally, in order to make a comprehensive performance comparison, the proportional conflict redistribution rule #6 (PCR6) is regarded as a baseline in a range of experiments. According to the results of experiments, MRC is more effective in accuracy of recommendations compared to original Rigid Coarsening (RC) method and comparable in computational time. |
format | Online Article Text |
id | pubmed-5774721 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-57747212018-02-05 A fast combination method in DSmT and its application to recommender system Dong, Yilin Li, Xinde Liu, Yihai PLoS One Research Article In many applications involving epistemic uncertainties usually modeled by belief functions, it is often necessary to approximate general (non-Bayesian) basic belief assignments (BBAs) to subjective probabilities (called Bayesian BBAs). This necessity occurs if one needs to embed the fusion result in a system based on the probabilistic framework and Bayesian inference (e.g. tracking systems), or if one needs to make a decision in the decision making problems. In this paper, we present a new fast combination method, called modified rigid coarsening (MRC), to obtain the final Bayesian BBAs based on hierarchical decomposition (coarsening) of the frame of discernment. Regarding this method, focal elements with probabilities are coarsened efficiently to reduce computational complexity in the process of combination by using disagreement vector and a simple dichotomous approach. In order to prove the practicality of our approach, this new approach is applied to combine users’ soft preferences in recommender systems (RSs). Additionally, in order to make a comprehensive performance comparison, the proportional conflict redistribution rule #6 (PCR6) is regarded as a baseline in a range of experiments. According to the results of experiments, MRC is more effective in accuracy of recommendations compared to original Rigid Coarsening (RC) method and comparable in computational time. Public Library of Science 2018-01-19 /pmc/articles/PMC5774721/ /pubmed/29351297 http://dx.doi.org/10.1371/journal.pone.0189703 Text en © 2018 Dong et al http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Dong, Yilin Li, Xinde Liu, Yihai A fast combination method in DSmT and its application to recommender system |
title | A fast combination method in DSmT and its application to recommender system |
title_full | A fast combination method in DSmT and its application to recommender system |
title_fullStr | A fast combination method in DSmT and its application to recommender system |
title_full_unstemmed | A fast combination method in DSmT and its application to recommender system |
title_short | A fast combination method in DSmT and its application to recommender system |
title_sort | fast combination method in dsmt and its application to recommender system |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5774721/ https://www.ncbi.nlm.nih.gov/pubmed/29351297 http://dx.doi.org/10.1371/journal.pone.0189703 |
work_keys_str_mv | AT dongyilin afastcombinationmethodindsmtanditsapplicationtorecommendersystem AT lixinde afastcombinationmethodindsmtanditsapplicationtorecommendersystem AT liuyihai afastcombinationmethodindsmtanditsapplicationtorecommendersystem AT dongyilin fastcombinationmethodindsmtanditsapplicationtorecommendersystem AT lixinde fastcombinationmethodindsmtanditsapplicationtorecommendersystem AT liuyihai fastcombinationmethodindsmtanditsapplicationtorecommendersystem |