A Fuzzy Decision Tree for Processing Satellite Images and Landsat Data
Bibliographic record
Abstract
Satellite and airborne images, including Landsat, ASTER, and Hyperspectral data, are widely used in remote sensing and Geo- graphic Information Systems (GIS) to understand natural earth related processes, climate change, and anthropogenic activity. The nature of this type of data is usually multi or hyperspectral with individual spectral bands stored in raster file structures of large size and global coverage. The elevated number of bands (on the order of 200 to 250 bands) requires data processing algorithms capable of extracting information content, removing redundancy. Conventional statistical methods have been devised to reduce dimension- ality however they lack specific processing to handle data diversity. Hence, in this paper we propose a new data analytic technique to classify these complex multidimensional data cubes. Here, we use a well-known database consisting of multi-spectral values of pixels from satellite images, where the classification is associated with the central pixel in each neighborhood. The goal of our proposed approach is to predict this classification based on the given multi-spectral values. To solve this classification problem, we propose an improved decision tree (DT) algorithm based on a fuzzy approach. More particularly, we introduce a new hybrid classification algorithm that utilizes the conventional decision tree algorithm enhanced with the fuzzy approach. We propose an improved data classification algorithm that utilizes the best of a decision tree and multi-criteria classification. To investigate and evaluate the performance of our proposed method against other DT classifiers, a comparative and analytical study is conducted on well-known Landsat data.
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.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".