TY - GEN
T1 - Incremental projection vector machine
T2 - 23rd Australasian Joint Conference on Artificial Intelligence, AI 2010
AU - Zheng, Qinghua
AU - Wang, Xin
AU - Deng, Wanyu
AU - Liu, Jun
AU - Wu, Xiyuan
PY - 2010
Y1 - 2010
N2 - Dimension reduction has been widely employed to deal with the curse of dimensionality before training supervised learning such as neural network and this framework combining dimension reduction and supervised learning algorithms is called as two-stage approach. However during the process of this approach, the system has to store original data and pre-process data simultaneously which will increase the complexity and re-compute the SVD when the new data arrive. To address the above problems, this paper proposes a novel learning algorithm for high-dimension large-scale data, by combining a new incremental dimension reduction with feed-forward neural network training simultaneously, called Incremental Projection Vector Machine (IPVM). With new samples arriving, instead of re-computing the full rank SVD of the whole dataset, an incremental method is applied to update the original SVD. It is suitable for high-dimension large-sample data for the singular vectors are updated incrementally. Experimental results showed that the proposed one-stage algorithm IPVM was faster than two-stage learning approach such as SVD+BP and SVD+ELM, and performed better than conventional supervised algorithms.
AB - Dimension reduction has been widely employed to deal with the curse of dimensionality before training supervised learning such as neural network and this framework combining dimension reduction and supervised learning algorithms is called as two-stage approach. However during the process of this approach, the system has to store original data and pre-process data simultaneously which will increase the complexity and re-compute the SVD when the new data arrive. To address the above problems, this paper proposes a novel learning algorithm for high-dimension large-scale data, by combining a new incremental dimension reduction with feed-forward neural network training simultaneously, called Incremental Projection Vector Machine (IPVM). With new samples arriving, instead of re-computing the full rank SVD of the whole dataset, an incremental method is applied to update the original SVD. It is suitable for high-dimension large-sample data for the singular vectors are updated incrementally. Experimental results showed that the proposed one-stage algorithm IPVM was faster than two-stage learning approach such as SVD+BP and SVD+ELM, and performed better than conventional supervised algorithms.
KW - Extreme Learning Machine
KW - Incremental Projection Vector Machine
KW - Neural network
KW - Projection Vector Machine
KW - Singular vector decomposition
UR - https://www.scopus.com/pages/publications/78650782820
U2 - 10.1007/978-3-642-17432-2_14
DO - 10.1007/978-3-642-17432-2_14
M3 - 会议稿件
AN - SCOPUS:78650782820
SN - 3642174310
SN - 9783642174315
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 132
EP - 141
BT - AI 2010
Y2 - 7 December 2010 through 10 December 2010
ER -