MétaCan
Menu
Back to cohort
Record W625600254 · doi:10.1017/cbo9780511536687

Nonparametric System Identification

2008· book· en· W625600254 on OpenAlexaff
Włodzimierz Greblicki, M. Pawlak

Bibliographic record

VenueCambridge University Press eBooks · 2008
Typebook
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsIdentification (biology)Nonparametric statisticsLegendre polynomialsNonlinear system identificationSystem identificationComputer scienceNonlinear systemParametric statisticsHermite polynomialsKernel (algebra)TrigonometryApplied mathematicsAlgorithmMathematicsTheoretical computer scienceData miningEconometricsStatistics

Abstract

fetched live from OpenAlex

Presenting a thorough overview of the theoretical foundations of non-parametric system identification for nonlinear block-oriented systems, this book shows that non-parametric regression can be successfully applied to system identification, and it highlights the achievements in doing so. With emphasis on Hammerstein, Wiener systems, and their multidimensional extensions, the authors show how to identify nonlinear subsystems and their characteristics when limited information exists. Algorithms using trigonometric, Legendre, Laguerre, and Hermite series are investigated, and the kernel algorithm, its semirecursive versions, and fully recursive modifications are covered. The theories of modern non-parametric regression, approximation, and orthogonal expansions, along with new approaches to system identification (including semiparametric identification), are provided. Detailed information about all tools used is provided in the appendices. This book is for researchers and practitioners in systems theory, signal processing, and communications and will appeal to researchers in fields like mechanics, economics, and biology, where experimental data are used to obtain models of systems.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.019
Threshold uncertainty score0.063

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0190.009

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.

Opus teacher head0.011
GPT teacher head0.162
Teacher spread0.151 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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".

Quick stats

Citations209
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueCambridge University Press eBooksSame topicControl Systems and IdentificationFrench-language works237,207