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

A Quantum-Based Chameleon Swarm for Feature Selection

Author

Listed:
  • Mohamed Abd Elaziz

    (Department of Mathematics, Faculty of Science, Zagazig University, Zagazig 44519, Egypt
    Artificial Intelligence Research Center (AIRC), College of Engineering and Information Technology, Ajman University, Ajman P.O. Box 346, United Arab Emirates
    Faculty of Computer Science and Engineering, Galala University, Suez 435611, Egypt
    Department of Electrical and Computer Engineering, Lebanese American University, Byblos 13-5053, Lebanon)

  • Mahmoud Ahmadein

    (Mechanical Engineering Department, Imam Mohammad Ibn Saud Islamic University, Riyadh 11564, Saudi Arabia
    Department of Production Engineering and Mechanical Design, Faculty of Engineering, Tanta University, Tanta 31527, Egypt)

  • Sabbah Ataya

    (Mechanical Engineering Department, Imam Mohammad Ibn Saud Islamic University, Riyadh 11564, Saudi Arabia)

  • Naser Alsaleh

    (Mechanical Engineering Department, Imam Mohammad Ibn Saud Islamic University, Riyadh 11564, Saudi Arabia)

  • Agostino Forestiero

    (Institute for High Performance Computing and Networking, National Research Council of Italy, 87036 Rende, Italy)

  • Ammar H. Elsheikh

    (Department of Production Engineering and Mechanical Design, Faculty of Engineering, Tanta University, Tanta 31527, Egypt)

Abstract

The Internet of Things is widely used, which results in the collection of enormous amounts of data with numerous redundant, irrelevant, and noisy features. In addition, many of these features need to be managed. Consequently, developing an effective feature selection (FS) strategy becomes a difficult goal. Many FS techniques, based on bioinspired metaheuristic methods, have been developed to tackle this problem. However, these methods still suffer from limitations; so, in this paper, we developed an alternative FS technique, based on integrating operators of the chameleon swarm algorithm (Cham) with the quantum-based optimization (QBO) technique. With the use of eighteen datasets from various real-world applications, we proposed that QCham is investigated and compared to well-known FS methods. The comparisons demonstrate the benefits of including a QBO operator in the Cham because the proposed QCham can efficiently and accurately detect the most crucial features. Whereas the QCham achieves nearly 92.6%, with CPU time(s) nearly 1.7 overall the tested datasets. This indicates the advantages of QCham among comparative algorithms and high efficiency of integrating the QBO with the operators of Cham algorithm that used to enhance the process of balancing between exploration and exploitation.

Suggested Citation

  • Mohamed Abd Elaziz & Mahmoud Ahmadein & Sabbah Ataya & Naser Alsaleh & Agostino Forestiero & Ammar H. Elsheikh, 2022. "A Quantum-Based Chameleon Swarm for Feature Selection," Mathematics, MDPI, vol. 10(19), pages 1-17, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3606-:d:931990
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3606/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3606/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mokhtar Said & Ali M. El-Rifaie & Mohamed A. Tolba & Essam H. Houssein & Sanchari Deb, 2021. "An Efficient Chameleon Swarm Algorithm for Economic Load Dispatch Problem," Mathematics, MDPI, vol. 9(21), pages 1-14, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Seyed Hamidreza Hazaveh & Ali Bayandour & Azam Khalili & Ali Barkhordary & Ali Farzamnia & Ervin Gubin Moung, 2023. "Impulsive Noise Suppression Methods Based on Time Adaptive Self-Organizing Map," Energies, MDPI, vol. 16(4), pages 1-15, February.

    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. Hu, Gang & Yang, Rui & Wei, Guo, 2023. "Hybrid chameleon swarm algorithm with multi-strategy: A case study of degree reduction for disk Wang–Ball curves," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 709-769.
    2. Aokang Pang & Huijun Liang & Chenhao Lin & Lei Yao, 2023. "A Surrogate-Assisted Adaptive Bat Algorithm for Large-Scale Economic Dispatch," Energies, MDPI, vol. 16(2), pages 1-23, January.
    3. Alaa A. K. Ismaeel & Essam H. Houssein & Doaa Sami Khafaga & Eman Abdullah Aldakheel & Ahmed S. AbdElrazek & Mokhtar Said, 2023. "Performance of Osprey Optimization Algorithm for Solving Economic Load Dispatch Problem," Mathematics, MDPI, vol. 11(19), pages 1-19, September.

    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:10:y:2022:i:19:p:3606-:d:931990. 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.