Hybrid Bat and Salp Swarm Algorithm for Feature Selection and Classification of Crisis-Related Tweets in Social Networks
Bibliographic record
Abstract
Twitter is a useful tool for effectively tracking and managing crisis-related incidents. However, due to many irrelevant features in textual data, the problem of high dimensionality arises, which eventually increases the computational cost and decreases classification performance. Thus, to handle such a problem, this work presents a Spark-based hybrid binary Bat (BBA) and binary Salp swarm algorithm (BSSA) named SBBASSA for feature selection and classification of crisis-related tweets. In the proposed technique, the hybridization of standard BBA and BSSA algorithms is performed to enhance their exploration capabilities, then the combined algorithm is implemented in parallel using Apache Spark framework to reduce the overall execution time during the feature selection process. A support vector machine (SVM) classifier is applied during the wrapper-based feature subset selection and classification. The performance of the proposed SBBASSA was analyzed on six benchmark crisis tweet datasets, namely Hurricane Sandy, Boston Bombings, Oklahoma Tornado, West Texas Explosion, Alberta Floods, and Queensland Floods, and then compared with standard BSSA, BBA, and binary particle swarm optimization (BPSO). Results showed that SBBASSA performed competently in the feature selection and classification, outperformed other algorithms in crisis tweet classification, and achieved the highest accuracy with the lowest feature set in a reduced execution time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".