@article{oai:kyutech.repo.nii.ac.jp:00005093,
 author = {Kurogi, Shuichi and 黒木, 秀一 and Toidani,  Mitsuki and Shigematsu,  Ryosuke and Matsuo, Kazuya and 松尾, 一矢},
 journal = {Neural Computing and Applications},
 month = {Jul},
 note = {Recently, we have presented a method of probabilistic prediction of chaotic time series. The method employs learning machines involving strong learners capable of making predictions with desirably long predictable horizons, where, however, usual ensemble mean for making representative prediction is not effective when there are predictions with shorter predictable horizons. Thus, the method selects a representative prediction from the predictions generated by a number of learning machines involving strong learners as follows: first, it obtains plausible predictions holding large similarity of attractors with the training time series and then selects the representative prediction with the largest predictable horizon estimated via LOOCV (leave-one-out cross-validation). The method is also capable of providing average and/or safe estimation of predictable horizon of the representative prediction. We have used CAN2s (competitive associative nets) for learning piecewise linear approximation of nonlinear function as strong learners in our previous study, and this paper employs bagging (bootstrap aggregating) to improve the performance, which enables us to analyze the validity and the effectiveness of the method.},
 pages = {341--349},
 title = {Performance improvement via bagging in probabilistic prediction of chaotic time series using similarity of attractors and LOOCV predictable horizon},
 volume = {29},
 year = {2017},
 yomi = {クロギ, シュウイチ and マツオ, カズヤ}
}