Please use this identifier to cite or link to this item:
|Title:||Parsimonious random vector functional link network for data streams||Authors:||Pratama, Mahardhika
Angelov, Plamen P.
Er, Meng Joo
|Keywords:||Random Vector Functional Link
Evolving Intelligent System
|Issue Date:||2017||Source:||Pratama, M., Angelov, P. P., Lughofer, E., & Er, J. M. (2018). Parsimonious random vector functional link network for data streams. Information Sciences, 430-431, 519-537.||Series/Report no.:||Information Sciences||Abstract:||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.||URI:||https://hdl.handle.net/10356/89370
|ISSN:||0020-0255||DOI:||10.1016/j.ins.2017.11.050||Rights:||© 2017 Elsevier Inc. This is the author created version of a work that has been peer reviewed and accepted for publication by Information Sciences, Elsevier Inc. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/j.ins.2017.11.050].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SCSE Journal Articles|
Files in This Item:
|Parsimonious Random Vector Functional Link Network.pdf||760.4 kB||Adobe PDF|
Updated on Sep 2, 2020
Updated on Mar 4, 2021
Updated on Mar 5, 2021
Updated on Mar 5, 2021
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.