An Intelligent Technique to Predict the Autism Spectrum Disorder Using Big Data Platform
Bibliographic record
Abstract
Autism or autism spectrum disorder (ASD) is considered a psychiatric disorder. It is a condition that puts constraints on the use of linguistic, cognitive, communicative, and social skills and abilities. Recently, many data mining techniques have been developed to help autism patients by discovering the main features of the condition and the correlation between them. In this paper, we employ the association classification (AC) technique as a data mining approach to predict whether or not an individual has an autism. The Intelligent Classification Based on Association rules (ICBA) algorithm is proposed for finding the correlations between the features to decide whether an individual has autism in its early stage, especially in childhood. The ICBA algorithm incorporates the chi-square method to select the best feature to make the decision, in addition to proposing new techniques in all phases and increasing number of folds to 2size of data/10. The proposed algorithm is compared against four well-known AC algorithms in terms of accuracy to evaluate their behavior in the prediction task using big data platform. The results show a better performance for the ICBA algorithm in most experiments. Moreover, all of the considered algorithms had an increased level of accuracy when the chi-square method was used.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| 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".