2022
DOI: 10.1038/s41598-022-13206-0
|View full text |Cite
|
Sign up to set email alerts
|

A machine learning approach to economic complexity based on matrix completion

Abstract: This work applies Matrix Completion (MC) – a class of machine-learning methods commonly used in recommendation systems – to analyze economic complexity. In this paper MC is applied to reconstruct the Revealed Comparative Advantage (RCA) matrix, whose elements express the relative advantage of countries in given classes of products, as evidenced by yearly trade flows. A high-accuracy binary classifier is derived from the MC application to discriminate between elements of the RCA matrix that are, respectively, h… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
21
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(21 citation statements)
references
References 13 publications
0
21
0
Order By: Relevance
“…A final remark can be made about the trade-off between the prediction capability and the biasedness of the MC method (see also the discussion on this issue presented in the Supplementary Material of Gnecco et al 2022). According to Foucart et al (2017) and Ma and Chen (2019), biasedness in MC depends, for instance, on how unobserved entries are selected (in our case, only entries associated with selected skills are obscured, and for the professions for which this occurs, all the entries associated with such skills are actually obscured).…”
Section: Declarationsmentioning
confidence: 99%
“…A final remark can be made about the trade-off between the prediction capability and the biasedness of the MC method (see also the discussion on this issue presented in the Supplementary Material of Gnecco et al 2022). According to Foucart et al (2017) and Ma and Chen (2019), biasedness in MC depends, for instance, on how unobserved entries are selected (in our case, only entries associated with selected skills are obscured, and for the professions for which this occurs, all the entries associated with such skills are actually obscured).…”
Section: Declarationsmentioning
confidence: 99%
“…For each instance, the best value of was found by minimizing a suitable error on the validation set, whereas the final performance was evaluated on the test set. Further details on the MC optimization problem (1) and on the Soft Impute algorithm can be found in Metulini et al (2022) and in the Supplementary Material of Gnecco, Nutarelli, and Riccaboni (2022).…”
Section: Matrix Completionmentioning
confidence: 99%
“…Again, introducing a new IS may raise uncertainties that cause system users to doubt its usefulness. Notably, the uncertainties may be driven by the perceived complexity of the new system or doubts about its effectiveness (Gnecco et al, 2022; Al‐Okaily, 2021). Based on PDT, doubts about system usefulness are eliminated when system users are involved in the design process (Gnecco et al, 2022; Al‐Okaily, 2021; Choe, 1998).…”
Section: Literature Reviewmentioning
confidence: 99%