Nonparametric Density Estimation, Prediction, and Regression for Markov Sequences
马尔可夫序列的非参数密度估计、预测与回归AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究平稳序列的转移规律和条件均值预测,并将方法与 ARMA 比较,支持时间序列与预测分类。
马尔可夫序列的非参数密度估计、预测与回归AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Let {Xi } be a stationary Markov sequence having a transition probability density function f(y | x) giving the pdf of X i +1 | (Xi = x). In this study, nonparametric density and regression techniques are employed to infer f(y | x) and m(x) = E[X i + 1 | Xi = x]. It is seen that under certain regularity and Markovian assumptions, the asymptotic convergence rate of the nonparametric estimator mn (x) to the predictor m(x) is the same as it would have been had the Xi 's been independently and identically distributed, and this rate is optimal in a certain sense. Consistency can be maintained after differentiability and even the Markovian assumptions are abandoned. Computational and modeling ramifications are explored. I claim that my methodology offers an interesting alternative to the popular ARMA approach.