Structure Choice for Relations between Objects in Metric Classification Algorithms
We analyze the cluster structure of learning samples, decomposing class objects into disjoint groups. Decomposition results are used for the computation of the compactness measure for the sample and its minimal coverage by standard objects. We show that the number of standard objects depends on the metric choice, the distance to noise objects, the scales of the feature measurements, and nonlinear transformations of the feature space. We experimentally prove that the set of standards of the minimal coverage and noise objects affect the algorithm generalizing ability.
Keywordscompactness measures spans of classes noise objects nonlinear transformations
Unable to display preview. Download preview PDF.
- 1.N. G. Zagoruiko, O. A. Kutnenko, A. O. Zyryanov, and D. A. Levanov, “Learning to recognition without overfitting Обучение распознаванию образов без пере–обучения,” Mash. Obuch. Anal. Dannykh (Mach. Learn. Data Anal.) 1 (7), 891–901 (2014) [in Russian].Google Scholar
- 2.K. V. Vorontsov, “A combinatorial approach to estimating the quality of learning algorithms,” in Mathematical Problems in Cybernetics (Fizmatlit, Moscow, 2004), No. 13, pp. 5–36 [in Russian].Google Scholar
- 5.D. Y. Saidov, “Data visualization and its proof by compactness criterion of objects of classes,” Int. J. Intell. Syst. Appl. (IJISA) 9 (8), 51–58 (2017).Google Scholar
- 6.http://archive.ics.uci.edu/ml/datasetsGoogle Scholar