Online Sequential Projection Vector Machine with Adaptive Data Mean Update

الملخص EN

We propose a simple online learning algorithm especial for high-dimensional data.

The algorithm is referred to as online sequential projection vector machine (OSPVM) which derives from projection vector machine and can learn from data in one-by-one or chunk-by-chunk mode.

In OSPVM, data centering, dimension reduction, and neural network training are integrated seamlessly.

In particular, the model parameters including ( 1 ) the projection vectors for dimension reduction, ( 2 ) the input weights, biases, and output weights, and ( 3 ) the number of hidden nodes can be updated simultaneously.

Moreover, only one parameter, the number of hidden nodes, needs to be determined manually, and this makes it easy for use in real applications.

Performance comparison was made on various high-dimensional classification problems for OSPVM against other fast online algorithms including budgeted stochastic gradient descent (BSGD) approach, adaptive multihyperplane machine (AMM), primal estimated subgradient solver (Pegasos), online sequential extreme learning machine (OSELM), and SVD + OSELM (feature selection based on SVD is performed before OSELM).

The results obtained demonstrated the superior generalization performance and efficiency of the OSPVM.