Acclimatizing Fast Orthogonal Search (FOS) Model for River Stream-flow Forecasting
Bibliographic record
Abstract
Abstract. River stream-flow is well-thought-out as an essential element in the hydrology studies, especially for reservoir management. Forecasting river stream-flow is the key for the hydrologists in proposing certain short or long-term planning and management for water resources system. In fact, developing stream-flow forecasting models are generally categorized into two main classes; process and data-driven model. Different model techniques based on empirical methods, such as stochastic model or regression model, more recently, Artificial Intelligent (AI) models have been examined and could provide accurate stream-flow forecasting. However, AI models experienced crucial difficulty is the necessity to utilize appropriate pre-processing methods for the raw data. In addition, the AI model should be augmented with proper optimization model to adjust the model parameters to achieve the optimal accuracy. In this paper, a novel model namely; Fast Orthogonal Search (FOS) model is proposed to develop river stream-flow forecasting. FOS is basically structured for recognizing the difference equation and its functional expression model for the mapping between the model input and output. The major advantage of using FOS is the waiver of the requirement of data pre-processing and optimization model for model parameters adjustment as these procedures are performed implicitly inside FOS. In addition, pole-zero cancellation procedure within FOS process can detect the over-fitted models and avoid them. The proposed FOS method was adopted in this research to perform stream-flow forecasting model at Aswan High Dam using monthly basis for130 years. Results showed outstanding performance for stream-flow forecasting accuracy compared to other AI models developed during the last 10 years.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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.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".