An Incremental Parallel Particle Swarm Approach for Classification Rule Discovery from Dynamic Data
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Classification is a supervised learning technique that predicts the classes of unobserved data by employing a model built from available data. One of the efficient ways to represent this predictive model is to express it as an optimal set of classification rules to provide comprehensibility and precision, simultaneously. In this paper, we propose a novel incremental parallel Particle Swarm Optimization (PSO) approach for classification rule discovery. Our proposed method separates the training data into a set of data chunks regarding the classes and extracts optimal set of classification rules for each chunk in a parallel manner. In order to extract the rules from data chunks, we introduce an incremental PSO algorithm in which the previously extracted rules are directly employed to initialize the swarm population. Moreover, in each generation of the swarm, a tournament method is employed to substitute the weak individuals with strong extracted knowledge. To support the parallelism, we assign a PSO thread for each data chunk. As soon as all the PSO threads are completed, the extracted rules are integrated into a rule-base to construct a classification model. The evaluation results of the proposed approach on six datasets suggest that the classification precision of our proposed framework is competitive with offline learning methods and is 35% faster than its counterpart offline PSO approach.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 it