.png){kind=icon}
.png){kind=icon}
Return
Scalable Hyper-Ellipsoidal Function With Projection Ratio for Local Distributed Streaming Data Classification
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2997944.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Learning streaming data with limited size of memory storage becomes an interesting problem. Although there have been several learning methods recently proposed, based on the interesting concept of discard-after-learn, the performance of these issues: the learning speed, number of redundant neurons, and classification accuracy of these methods can be further improved in terms of faster speed, less number of neurons, and higher accuracy. The following new concepts and approaches were proposed in this paper: (1) a more generic structure of hyper-ellipsoidal function called Scalable Hyper-Ellipsoidal Function (SHEF) capable of handling the problem of a curse of dimensionality by introducing a regularization parameter into the covariance matrix of SHEF; (2) a new recursive function to update the covariance matrix of SHEF based on only the incoming data chunk; (3) a fast and easy conditions to test the states of being overlapped, inside, and touching of two SHEFs; (4) a new distance measure for determining the class of a queried datum based on the projected distance on only one discriminant vector, namely the Projection Ratio. The experimental results show the significant improvement when compared with the results from VLLDA, ILDA, LOL, VEBF, and CIL in terms of classification accuracy, the number of generated neurons, and computational time.
Keywords:
Neurons
Training data
Covariance matrices
Testing
Training
Memory management
Feature extraction
Streaming data classification
discriminant analysis
discard-after-learn
incremental learning
projection ratio
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.