IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i5p759-d1350656.html
   My bibliography  Save this article

Searching by Topological Complexity: Lightweight Neural Architecture Search for Coal and Gangue Classification

Author

Listed:
  • Wenbo Zhu

    (School of Mechatronic Engineering and Automation, Foshan University, Foshan 528200, China)

  • Yongcong Hu

    (School of Mechatronic Engineering and Automation, Foshan University, Foshan 528200, China)

  • Zhengjun Zhu

    (China Coal Technology Engineering Group Tangshan Research Institute, Tangshan 063000, China)

  • Wei-Chang Yeh

    (Integration and Collaboration Laboratory, Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300044, Taiwan)

  • Haibing Li

    (School of Mechatronic Engineering and Automation, Foshan University, Foshan 528200, China)

  • Zhongbo Zhang

    (School of Mechatronic Engineering and Automation, Foshan University, Foshan 528200, China)

  • Weijie Fu

    (School of Mechatronic Engineering and Automation, Foshan University, Foshan 528200, China)

Abstract

Lightweight and adaptive adjustment are key research directions for deep neural networks (DNNs). In coal industry mining, frequent changes in raw coal sources and production batches can cause uneven distribution of appearance features, leading to concept drift problems. The network architecture and parameters should be adjusted frequently to avoid a decline in model accuracy. This poses a significant challenge for those without specialist expertise. Although the Neural Architecture Search (NAS) has a strong ability to automatically generate networks, enabling the automatic design of highly accurate networks, it often comes with complex internal topological connections. These redundant architectures do not always effectively improve network performance, especially in resource-constrained environments, where their computational efficiency is significantly reduced. In this paper, we propose a method called Topology Complexity Neural Architecture Search (TCNAS). TCNAS proposes a new method for evaluating the topological complexity of neural networks and uses both topological complexity and accuracy to guide the search, effectively obtaining lightweight and efficient networks. TCNAS employs an adaptive shrinking search space optimization method, which gradually eliminates poorly performing cells to reduce the search space, thereby improving search efficiency and solving the problem of space explosion. In the classification experiments of coal and gangue, the optimal network designed by TCNAS has an accuracy of 83.3%. And its structure is much simpler, which is about 1/53 of the parameters of the network dedicated to coal and gangue recognition. Experiments have shown that TCNAS is able to generate networks that are both efficient and simple for resource-constrained industrial applications.

Suggested Citation

  • Wenbo Zhu & Yongcong Hu & Zhengjun Zhu & Wei-Chang Yeh & Haibing Li & Zhongbo Zhang & Weijie Fu, 2024. "Searching by Topological Complexity: Lightweight Neural Architecture Search for Coal and Gangue Classification," Mathematics, MDPI, vol. 12(5), pages 1-24, March.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:5:p:759-:d:1350656
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/5/759/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/5/759/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Koon Meng Ang & Wei Hong Lim & Sew Sun Tiang & Abhishek Sharma & S. K. Towfek & Abdelaziz A. Abdelhamid & Amal H. Alharbi & Doaa Sami Khafaga, 2023. "MTLBORKS-CNN: An Innovative Approach for Automated Convolutional Neural Network Design for Image Classification," Mathematics, MDPI, vol. 11(19), pages 1-44, September.
    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.

      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:jmathe:v:12:y:2024:i:5:p:759-:d:1350656. 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.