Online sequential extreme learning machine (OS-ELM) proposed by Liang et al. employ sequential learning strategy to learn the target concept from the data. Compared with the original ELM, OS-ELM can learn data one-by-one or chunk-by-chunk with fixed or varying chunk size with almost same performance as ELM. While compared with other state-ofthe-art sequential algorithms such as SGBP, RAN and GAP-RBF, OS-ELM has faster learning speed and better generalization ability. However, similar to ELM, OS-ELM also has instability in different trials of simulations. In addition, for large data sets, OS-ELM will not halt when there are training samples not be learned, this phenomenon results in long learning time. In order to deal with the problems, this paper proposes an algorithm named E-OS-ELM for integrating OS-ELM to classify large data sets. The experimental results show that the proposed method is effective and efficient; it can effectively overcome the drawbacks mentioned above.

No abstract