A Mahalanobis hyperellipsoidal learning machine class incremental learning algorithm (Q1725205)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Mahalanobis hyperellipsoidal learning machine class incremental learning algorithm |
scientific article; zbMATH DE number 7023256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Mahalanobis hyperellipsoidal learning machine class incremental learning algorithm |
scientific article; zbMATH DE number 7023256 |
Statements
A Mahalanobis hyperellipsoidal learning machine class incremental learning algorithm (English)
0 references
14 February 2019
0 references
Summary: A Mahalanobis hyperellipsoidal learning machine class incremental learning algorithm is proposed. To each class sample, the hyperellipsoidal that encloses as many as possible and pushes the outlier samples away is trained in the feature space. In the process of incremental learning, only one subclassifier is trained with the new class samples. The old models of the classifier are not influenced and can be reused. In the process of classification, considering the information of sample's distribution in the feature space, the Mahalanobis distances from the sample mapping to the center of each hyperellipsoidal are used to decide the classified sample class. The experimental results show that the proposed method has higher classification precision and classification speed.
0 references
0.8620648384094238
0 references
0.7200589776039124
0 references
0.7143860459327698
0 references
0.7102257609367371
0 references