Author
Abstract
The increasing integration of machine learning techniques in hedonic imputation has significantly improved predictive capabilities for both price prediction and price index computation. Nevertheless, the lack of transparency, particularly regarding model explainability, remains a notable challenge. This paper undertakes a comprehensive investigation through simulation and empirical analysis, focusing specifically on linear hedonic regression and tree-based machine learning methods, with the aim of elucidating the economic rationale behind machine learning predictions. Our comparative analysis highlights the superior performance of random forests over traditional hedonic regression models. This enhanced performance is critically dependent on assumptions about consumer utility functional forms: tree-based algorithms outperform linear hedonic models most significantly when assuming limited substitutability between product attributes, a characteristic that aligns with the algorithm’s design. The core contribution of this research is the development of a novel model explainability framework that bridges the gap between economics and machine learning. By shedding light on the economic rationale behind machine learning outcomes, we address the growing demand for interpretable machine learning approaches within the economics community. This framework not only enhances the transparency of machine learning models but also provides valuable insights for their application in real-world economic scenarios.
Suggested Citation
Shipei Zeng & Deyu Rao, 2025.
"Random Forests with Economic Roots: Explaining Machine Learning in Hedonic Imputation,"
Computational Economics, Springer;Society for Computational Economics, vol. 66(3), pages 2457-2481, September.
Handle:
RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10798-9
DOI: 10.1007/s10614-024-10798-9
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:66:y:2025:i:3:d:10.1007_s10614-024-10798-9. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.