The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Stochastic Configuration Networks: Fundamentals and Algorithms
Open accessAbstract
This paper contributes to the development of randomized methods for neural networks. The proposed learner model is generated incrementally by stochastic configuration (SC) algorithms, termed SC networks (SCNs). In contrast to the existing randomized learning algorithms for single layer feed-forward networks, we randomly assign the input weights and biases of the hidden nodes in the light of a supervisory mechanism, and the output weights are analytically evaluated in either a constructive or selective manner. As fundamentals of SCN-based data modeling techniques, we establish some theoretical results on the universal approximation property. Three versions of SC algorithms are presented for data regression and classification problems in this paper. Simulation results concerning both data regression and classification indicate some remarkable merits of our proposed SCNs in terms of less human intervention on the network size setting, the scope adaptation of random parameters, fast learning, and sound generalization.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
A fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Speech recognition with deep recurrent neural networks
Graves, A., Mohamed, A.-R., & Hinton, G. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638947 · Cited by 8,893 · cited 1×
“easily. As a technical contribution to the machine learning community, our proposed stochastic configuration idea in this paper is significant and applicable for data representation with deep learning [6, 8, 9, 17]. Plenty of researches on SCNs and its applications can be explored in the future, and some of them have be…”
BackgroundUniversal Approximation Using Radial-Basis-Function Networks
Park, J., & Sandberg, I. W. (1991) · Neural Computation · doi:10.1162/neco.1991.3.2.246 · Cited by 4,112
Radial Basis Functions, Multi-Variable Functional Interpolation and Adaptive Networks
Broomhead, D. S., & Lowe, D. (1988) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 3,443
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Chen, T., & Chen, H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.392253 · Cited by 1,230
Learning and generalization characteristics of the random vector functional-link net
Pao, Y.-H., Park, G.-H., & Sobajic, D. J. (1994) · Neurocomputing · doi:10.1016/0925-2312(94)90053-1 · Cited by 1,138
Stochastic choice of basis functions in adaptive function approximation and the functional-link net
Igelnik, B., & Pao, Y.-H. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471375 · Cited by 955
Functional-link net computing: theory, system architecture, and functionalities
Pao, Y.-H., & Takefuji, Y. (1992) · Computer · doi:10.1109/2.144401 · Cited by 927
The theory of matrices : with applications
Lancaster, P., & Tismenetsky, M. (1985) · Cited by 791
Feedforward neural networks with random weights
Schmidt, W. F., Kraaijveld, M. A., & Duin, R. P. W. (2003) · Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol.II. Conference B: Pattern Recognition Methodology and Systems · doi:10.1109/icpr.1992.201708 · Cited by 540
Jones, L. K. (1992) · The Annals of Statistics · doi:10.1214/aos/1176348546 · Cited by 474
Theory of the backpropagation neural network
Hecht-Nielsen, R. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90469-8 · Cited by 472
Randomized Algorithms for Matrices and Data
MAHONEY, M. (2012) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/b11822-37 · Cited by 409
Randomness in neural networks: an overview
Scardapane, S., & Wang, D. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1200 · Cited by 352
Self-citationLearning internal representations by back-propagating errors
Rumelhart, D. E. (1986) · Medical Entomology and Zoology · Cited by 337
Objective functions for training new hidden units in constructive neural networks
Kwok, T.-Y., & Yeung, D.-Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.623214 · Cited by 238
Randomized Algorithms for Matrices and Data
Mahoney, M. W. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000035 · Cited by 232
Insights into randomized algorithms for neural networks: Practical issues and common pitfalls
Li, M., & Wang, D. (2017) · Information Sciences · doi:10.1016/j.ins.2016.12.007 · Cited by 216
Self-citationCoupled Deep Autoencoder for Single Image Super-Resolution
Zeng, K., Yu, J., Wang, R., Li, C., & Tao, D. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2501373 · Cited by 214
Wang, D., & Li, M. (2017) · Information Sciences · doi:10.1016/j.ins.2017.05.047 · Cited by 156
Self-citationDistributed learning for Random Vector Functional-Link networks
Scardapane, S., Wang, D., Panella, M., & Uncini, A. (2015) · Information Sciences · doi:10.1016/j.ins.2015.01.007 · Cited by 154
Self-citationApproximation with random bases: Pro et Contra
Gorban, A. N., Tyukin, I., Prokhorov, D. V., & Sofeikov, K. (2015) · Information Sciences · doi:10.1016/j.ins.2015.09.021 · Cited by 135
Wang, D., & Cui, C. (2017) · Information Sciences · doi:10.1016/j.ins.2017.07.003 · Cited by 132
Self-citationDeep Stochastic Configuration Networks with Universal Approximation Property
Wang, D., & Li, M. (2018) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2018.8489695 · Cited by 126
Self-citationFeasibility of random basis function approximators for modeling and control
Tyukin, I., & Prokhorov, D. V. (2009) · doi:10.1109/cca.2009.5281061 · Cited by 95
Editorial: Randomized algorithms for training neural networks
Wang, D. (2016) · Information Sciences · doi:10.1016/j.ins.2016.05.021 · Cited by 66
Self-citationBayesian Random Vector Functional-Link Networks for Robust Data Modeling
Scardapane, S., Wang, D., & Uncini, A. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2726143 · Cited by 41
Self-citation
Cited by
A systematic review: machine learning based recommendation systems for e-learning
Khanal, S. S., Prasad, P. W. C., Alsadoon, A., & Maag, A. (2020) · Education and Information Technologies · doi:10.1007/s10639-019-10063-9 · Cited by 359
A stochastic configuration network based on chaotic sparrow search algorithm
Zhang, C., & Ding, S. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106924 · Cited by 342
Personalized learning full-path recommendation model based on LSTM neural networks
Zhou, Y., Huang, C., Hu, Q., Zhu, J., & Tang, Y. (2018) · Information Sciences · doi:10.1016/j.ins.2018.02.053 · Cited by 253
Yang, J., Zhang, L., Chen, C., Li, Y., Li, R., Wang, G., Jiang, S., & Zeng, Z. (2020) · Information Sciences · doi:10.1016/j.ins.2020.05.090 · Cited by 123
Yang, J., Yang, F., Zhou, Y., Wang, D., Li, R., Wang, G., & Chen, W. (2021) · Information Sciences · doi:10.1016/j.ins.2021.02.064 · Cited by 100
Self-citation
Metadata
- Authors
- Wang, D., & Li, M.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-10
- Volume
- 47
- Issue
- 10
- Pages
- 3466-3479
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2593382986
- Cited by
- 727
- References
- 35
- FWCI
- 26.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.