{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T04:03:56Z","timestamp":1741579436415,"version":"3.38.0"},"reference-count":0,"publisher":"Zarqa University","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IAJIT"],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:p>The exponential growth of data sources brings the challenge of maintaining the processing performance and reducing computation complexity. One of the vital solutions is the success in preserving the significant attributes. Consequently, this research focuses on proposing an effective method for feature selection which is based on the adaptation of the chicken swarm optimization algorithm. The research focuses on adapting the algorithm strategy in the process of searching the data space from random-based strategy to a more systematic method which ensures raising the algorithm performance. The study proposes a novel search strategy based on applying an effective clustering technique to effectively identify the main algorithm players which consequently enhance the algorithm performance. On the other hand, focusing on business objectives, this research proposes a novel framework that focuses on the patients\u2019 backlogs. The study applies the proposed enhancement to eliminate the patients\u2019 backlog while maintaining the prioritization. The proposed framework is generic and could be applied to the concept of backlogs in any domain. The experiment succeeded in confirming the applicability of the proposed adaptation for the chicken swarm optimization algorithm and reaching the business goal with a minimum accuracy percentage equal to 95.3% for random forest and a maximum of 98.9 for naive Bayes<\/jats:p>","DOI":"10.34028\/iajit\/22\/2\/12","type":"journal-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T09:44:34Z","timestamp":1740563074000},"source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Chicken Swarm Algorithm for Feature Selection Optimization Targeting Efficient Patients Backlog Elimination"],"prefix":"10.34028","volume":"22","author":[{"given":"Emna","family":"Bouazizi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayman","family":"E. Khedr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amira","family":"M. Idrees","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"19944","published-online":{"date-parts":[[2025]]},"container-title":["The International Arab Journal of Information Technology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T07:49:53Z","timestamp":1741506593000},"score":1,"resource":{"primary":{"URL":"https:\/\/iajit.org\/upload\/files\/Leveraging-Chicken-Swarm-Algorithm-for-Feature-Selection-Optimization-Targeting-Efficient-Patients-Backlog-Elimination.pdf"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.34028\/iajit\/22\/2\/12","archive":["Internet Archive"],"relation":{},"ISSN":["2309-4524","1683-3198"],"issn-type":[{"type":"electronic","value":"2309-4524"},{"type":"print","value":"1683-3198"}],"subject":[],"published":{"date-parts":[[2025]]}}}