{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T06:47:10Z","timestamp":1760424430914},"reference-count":35,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0925-2312(01)00647-6","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T08:53:47Z","timestamp":1034153627000},"page":"279-297","source":"Crossref","is-referenced-by-count":16,"title":["Local averaging optimization for chaotic time series prediction"],"prefix":"10.1016","volume":"48","author":[{"given":"James","family":"McNames","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20135","key":"10.1016\/S0925-2312(01)00647-6_BIB1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1006559212014","article-title":"Locally weighted learning","volume":"11","author":"Atkeson","year":"1997","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB2","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB3","series-title":"Advances in Neural Information Processing Systems","first-page":"375","article-title":"Lazy learning meets the recursive least squares","author":"Birattari","year":"1999"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB4","unstructured":"G. Bontempi, M. Birattari, H. Bersini, Lazy learning for iterated time-series prediction, in: Proceedings of the International Workshop on Advanced Black-Box Techniques for Nonlinear Modeling, Katholieke Universiteit Leuven, Belgium, July 1998, pp. 62\u201368."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB5","unstructured":"G. Bontempi, M. Birattari, H. Bersini, Local learning for iterated time-series prediction, in: Machine Learning: Proceedings of the 16th International Conference, San Francisco, CA, 1999, pp. 32\u201338."},{"issue":"6","key":"10.1016\/S0925-2312(01)00647-6_BIB6","doi-asserted-by":"crossref","first-page":"2350","DOI":"10.1214\/aos\/1032181158","article-title":"Heuristics of instability and stabilization in model selection","volume":"24","author":"Breiman","year":"1996","journal-title":"The Ann. Statist."},{"issue":"3","key":"10.1016\/S0925-2312(01)00647-6_BIB7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.2307\/1403680","article-title":"Submodel selection and evaluation in regression: the x-random case","volume":"60","author":"Breiman","year":"1992","journal-title":"Int. Statist. Rev."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB8","first-page":"127","volume":"58","author":"Buzug","year":"1992","journal-title":"Comparison of algorithms calculating optimal embedding parameters for delay time coordinates, Physica D"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0167-2789(97)00118-8","article-title":"Practical method for determining the minimum embedding dimension of a scalar time series","volume":"110","author":"Cao","year":"1997","journal-title":"Physica D"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0167-2789(89)90074-2","article-title":"Nonlinear prediction of chaotic time series","volume":"35","author":"Casdagli","year":"1989","journal-title":"Physica D"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB11","series-title":"Applied Chaos","first-page":"335","article-title":"Nonlinear modeling of chaotic time series: theory and applications","author":"Casdagli","year":"1992"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB12","series-title":"Time Series Prediction","first-page":"347","article-title":"Exploring the continuum between deterministic and stochastic modeling","author":"Casdagli","year":"1994"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB13","series-title":"Evolution, Learning and Cognition","first-page":"277","article-title":"Exploiting chaos to predict the future and reduce noise","author":"Farmer","year":"1988"},{"issue":"8","key":"10.1016\/S0925-2312(01)00647-6_BIB14","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1103\/PhysRevLett.59.845","article-title":"Predicting chaotic time series","volume":"59","author":"Farmer","year":"1987","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB15","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0378-4371(97)00668-7","article-title":"Metric adaption for analog forecasting","volume":"253","author":"Fraedrich","year":"1998","journal-title":"Physica A"},{"issue":"3","key":"10.1016\/S0925-2312(01)00647-6_BIB16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Math. Software"},{"issue":"9","key":"10.1016\/S0925-2312(01)00647-6_BIB17","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1103\/PhysRevLett.76.1449","article-title":"Local optimal metrics and nonlinear modeling of chaotic time series","volume":"76","author":"Garc\u0131\u0301a","year":"1966","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1008159803952","article-title":"Adaptive metric kernel regression","volume":"26","author":"Goutte","year":"2000","journal-title":"J. VLSI Signal Process."},{"issue":"6","key":"10.1016\/S0925-2312(01)00647-6_BIB19","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1109\/34.506411","article-title":"Discriminant adaptive nearest neighbor classification","volume":"18","author":"Hastie","year":"1996","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/S0925-2312(01)00647-6_BIB20","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/83.480778","article-title":"Fast tree-structured nearest neighbor encoding for vector quantization","volume":"5","author":"Katsavounidis","year":"1996","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB21","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0167-2789(96)00054-1","article-title":"State space reconstruction parameters in the analysis of chaotic time series\u2014the role of the time window length","volume":"95","author":"Kugiumtzis","year":"1996","journal-title":"Physica D"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0167-2789(96)00292-8","article-title":"Assessing different norms in nonlinear analysis of noisy time series","volume":"105","author":"Kugiumtzis","year":"1997","journal-title":"Physica D"},{"issue":"1","key":"10.1016\/S0925-2312(01)00647-6_BIB23","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1162\/neco.1995.7.1.72","article-title":"Similarity metric learning for a variable-kernel classifier","volume":"7","author":"Lowe","year":"1995","journal-title":"Neural Comput."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB24","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1984"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB25","unstructured":"J. McNames, A nearest trajectory strategy for time series prediction, in: Proceedings of the International Workshop on Advanced Black-Box Techniques for Nonlinear Modeling, Katholieke Universiteit Leuven, Belgium, July 1998, pp. 112\u2013128."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB26","unstructured":"J. McNames, Innovations in local modeling for time series prediction, Ph.D. Thesis, Stanford University, 1999."},{"issue":"8","key":"10.1016\/S0925-2312(01)00647-6_BIB27","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1142\/S0218127499001048","article-title":"Winning entry of the K.U. Leuven time-series prediction competition","volume":"9","author":"McNames","year":"1999","journal-title":"Int. J. Bifurcation Chaos"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB28","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/0167-2789(93)90127-M","article-title":"Forecasting a chaotic time series using an improved metric for embedding space","volume":"68","author":"Murray","year":"1993","journal-title":"Physica D"},{"issue":"3","key":"10.1016\/S0925-2312(01)00647-6_BIB29","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF01053745","article-title":"Embedology","volume":"65","author":"Sauer","year":"1991","journal-title":"J. Statist. Phys."},{"issue":"8","key":"10.1016\/S0925-2312(01)00647-6_BIB30","doi-asserted-by":"crossref","first-page":"2047","DOI":"10.1162\/089976698300016963","article-title":"Constructive incremental learning from only local information","volume":"10","author":"Schaal","year":"1998","journal-title":"Neural Comput."},{"key":"10.1016\/S0925-2312(01)00647-6_BIB31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1098\/rsta.1994.0097","article-title":"Local optimal prediction: exploiting strangeness and the variation of sensitivity to initial condition","volume":"348","author":"Smith","year":"1994","journal-title":"Philos. Trans. Roy. Soc. A"},{"key":"10.1016\/S0925-2312(01)00647-6_BIB32","series-title":"Dynamical Systems and Turbulence","first-page":"336","article-title":"Detecting strange attractors in turbulence","volume":"Vol. 898","author":"Takens","year":"1981"},{"issue":"1","key":"10.1016\/S0925-2312(01)00647-6_BIB33","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1143\/JJAP.34.388","article-title":"An optimal metric for predicting chaotic time series","volume":"34","author":"Tanaka","year":"1995","journal-title":"Jpn. J. Appl. Phys."},{"issue":"10","key":"10.1016\/S0925-2312(01)00647-6_BIB34","doi-asserted-by":"crossref","first-page":"1550","DOI":"10.1109\/5.58337","article-title":"Backpropagation through time: what it does and how to do it","volume":"78","author":"Werbos","year":"1990","journal-title":"Proc. IEEE"},{"issue":"2","key":"10.1016\/S0925-2312(01)00647-6_BIB35","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1162\/neco.1989.1.2.270","article-title":"A learning algorithm for continually running fully recurrent neural networks","volume":"1","author":"Williams","year":"1989","journal-title":"Neural Comput."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231201006476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925231201006476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T23:51:41Z","timestamp":1554853901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925231201006476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":35,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0925231201006476"],"URL":"https:\/\/doi.org\/10.1016\/s0925-2312(01)00647-6","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}