Soybean Disease Detection with Feature Selection Using Stepwise Regression Algorithm: LVQ vs LVQ2
Bibliographic record
Abstract
ndonesia's soybean needs increase from year to year. But according to data from the Badan Pusat Statistik (BPS) the amount of national soybean productivity is still low, so the fulfillment of soybean needs is done by importing soybeans from several countries such as China, Ukraine, Canada, Malaysia, and the United States. Low soybean productivity is caused by several factors. One of the causes is disease. This study aims to create a soybean disease detection by applying Learning Vector Quantization 2 (LVQ2) neural network algorithm(ANN) and Stepwise Regression Algorithm attribute selection. The attribute variables used consisted of 35 symptoms of the disease in soybean crop data. The data used in this study is a soybean dataset taken from University of California Irvine Machine Learning Repository as much as 200 data. The distribution of training data and test data is done by the k-fold cross validation method with a value of k = 10. The result of the study shows that the best paramater use in lVQ2. The results showed that the best parameters in LVQ2 is learning rate (α) value of 0.3; epsilon 0.04; and maximum epoch 100. While the best attribute selection uses the parameter p to enter and p to remove of 0.15 which produces 17 selected attributes such as date, plant stand, precipitation, leaves, leaf spot halo, leaf spot margins, leafspot size, leaf mildew, stem canker, stem fungi, external decay, fruit pods, fruit spots, seeds, mold growth, seed discolor, roots. The best results in this study resulted in an accuracy of 90.5%, 9.5% error rate, 90.5% sensitivity, and 98.94% specificity
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 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.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 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".