Home > Research > Publications & Outputs > Parsimonious Random Vector Functional Link Netw...


Text available via DOI:

View graph of relations

Parsimonious Random Vector Functional Link Network for Data Streams

Research output: Contribution to journalJournal article

E-pub ahead of print
<mark>Journal publication date</mark>2/12/2017
<mark>Journal</mark>Information Sciences
Number of pages41
<mark>State</mark>E-pub ahead of print
Early online date2/12/17
<mark>Original language</mark>English


The majority of the existing work on random vector functional link networks (RVFLNs) is not scalable for data stream analytics because they work under a batch learning scenario and lack a self-organizing property. A novel RVLFN, namely the parsimonious random vector functional link network (pRVFLN), is proposed in this paper. pRVFLN adopts a fully flexible and adaptive working principle where its network structure can be configured from scratch and can be automatically generated, pruned and recalled from data streams. pRVFLN is capable of selecting and deselecting input attributes on the fly as well as capable of extracting important training samples for model updates. In addition, pRVFLN introduces a non-parametric type of hidden node which completely reflects the real data distribution and is not constrained by a specific shape of the cluster. All learning procedures of pRVFLN follow a strictly single-pass learning mode, which is applicable for online time-critical applications. The advantage of pRVFLN is verified through numerous simulations with real-world data streams. It was benchmarked against recently published algorithms where it demonstrated comparable and even higher predictive accuracies while imposing the lowest complexities.

Bibliographic note

This is the author’s version of a work that was accepted for publication in Information Sciences. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Sciences, ??, ?, 2017 DOI: 10.1016/j.ins.2017.11.050