IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i11p8888-d1160913.html
   My bibliography  Save this article

Assessing Forest Quality through Forest Growth Potential, an Index Based on Improved CatBoost Machine Learning

Author

Listed:
  • Lianjun Cao

    (College of Mathematics and Computer Science, Zhejiang A&F University, Hangzhou 311300, China
    Key Laboratory of State Forestry and Grassland Administration on Forestry Sensing Technology and Intelligent Equipment, Hangzhou 311300, China
    Key Laboratory of Forestry Intelligent Monitoring and Information Technology of Zhejiang Province, Hangzhou 311300, China)

  • Xiaobing He

    (Baishanzu Scientific Research Monitoring Center, Qianjiangyuan-Baishanzu National Park, Lishui 323000, China)

  • Sheng Chen

    (Zhejiang Forest Resources Monitoring Center, Hangzhou 311300, China)

  • Luming Fang

    (College of Mathematics and Computer Science, Zhejiang A&F University, Hangzhou 311300, China
    Key Laboratory of State Forestry and Grassland Administration on Forestry Sensing Technology and Intelligent Equipment, Hangzhou 311300, China
    Key Laboratory of Forestry Intelligent Monitoring and Information Technology of Zhejiang Province, Hangzhou 311300, China)

Abstract

Human activities have always depended on nature, and forests are an important part of this; the determination and improvement of forest quality is therefore highly significant. Currently, domestic and foreign research on forest quality focuses on the current states of forests. We propose a new research direction based on the future states. By referencing and analyzing the forest quality standards of domestic and foreign experts and institutions, the concept and model for calculating forest growth potential were constructed. Forest growth potential is a new forest quality indicator. Based on the data of 110,000 subcompartments of forest resources from the Lin’an and Landsat8 satellites’ remote sensing data, the unit volume was predicted using three machine-learning algorithms: random gradient descent SGD, the integrated machine learning algorithm CatBoost, and deep learning CNN. The CatBoost algorithm model was improved based on Optuna; then the improved CatBoost algorithm was selected through evaluation indicators for the prediction of forest volume and finally incorporated into the calculation model for forest growth-potential value. The forest growth-potential value was calculated, and an accurate forest quality improvement scheme based on the subcompartments is preliminarily discussed. The successful calculation of forest growth potential values has a certain reference significance, providing guidance for accurately improving forest quality and forest management. The improved CatBoost calculation model is effective in the prediction of forest growth potential, and the determination coefficient R 2 reaches 0.89, a value that compares favorably with those in other studies.

Suggested Citation

  • Lianjun Cao & Xiaobing He & Sheng Chen & Luming Fang, 2023. "Assessing Forest Quality through Forest Growth Potential, an Index Based on Improved CatBoost Machine Learning," Sustainability, MDPI, vol. 15(11), pages 1-18, May.
  • Handle: RePEc:gam:jsusta:v:15:y:2023:i:11:p:8888-:d:1160913
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/11/8888/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/15/11/8888/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fernando Lezama & Ricardo Faia & Pedro Faria & Zita Vale, 2020. "Demand Response of Residential Houses Equipped with PV-Battery Systems: An Application Study Using Evolutionary Algorithms," Energies, MDPI, vol. 13(10), pages 1-18, May.
    2. Jayanthi Rajarethinam & Joel Aik & Jing Tian, 2020. "The Influence of South East Asia Forest Fires on Ambient Particulate Matter Concentrations in Singapore: An Ecological Study Using Random Forest and Vector Autoregressive Models," IJERPH, MDPI, vol. 17(24), pages 1-14, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ovidiu Ivanov & Samiran Chattopadhyay & Soumya Banerjee & Bogdan-Constantin Neagu & Gheorghe Grigoras & Mihai Gavrilas, 2020. "A Novel Algorithm with Multiple Consumer Demand Response Priorities in Residential Unbalanced LV Electricity Distribution Networks," Mathematics, MDPI, vol. 8(8), pages 1-24, July.
    2. Christoforos Menos-Aikateriniadis & Ilias Lamprinos & Pavlos S. Georgilakis, 2022. "Particle Swarm Optimization in Residential Demand-Side Management: A Review on Scheduling and Control Algorithms for Demand Response Provision," Energies, MDPI, vol. 15(6), pages 1-26, March.
    3. Ningxuan Guo & Yinan Wang & Gangfeng Yan & Jian Hou, 2020. "Non-Cooperative Game in Block Bidding Markets Considering Demand Response," Energies, MDPI, vol. 13(13), pages 1-18, June.
    4. Khojasteh, Meysam & Faria, Pedro & Vale, Zita, 2022. "A robust model for aggregated bidding of energy storages and wind resources in the joint energy and reserve markets," Energy, Elsevier, vol. 238(PB).
    5. Francesco Mancini & Sabrina Romano & Gianluigi Lo Basso & Jacopo Cimaglia & Livio de Santoli, 2020. "How the Italian Residential Sector Could Contribute to Load Flexibility in Demand Response Activities: A Methodology for Residential Clustering and Developing a Flexibility Strategy," Energies, MDPI, vol. 13(13), pages 1-25, July.
    6. Ricardo Faia & Tiago Pinto & Zita Vale & Juan Manuel Corchado, 2021. "Prosumer Community Portfolio Optimization via Aggregator: The Case of the Iberian Electricity Market and Portuguese Retail Market," Energies, MDPI, vol. 14(13), pages 1-20, June.

    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:gam:jsusta:v:15:y:2023:i:11:p:8888-:d:1160913. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.