Why do we need the auxiliary vector representation for the metric pattern recognition problem?
dc.contributor.author | Goldfarb, Lev | |
dc.date.accessioned | 2023-03-01T18:28:36Z | |
dc.date.available | 2023-03-01T18:28:36Z | |
dc.date.issued | 1990 | |
dc.description.abstract | "Direct" pattern recognition algorithms in metric spaces, i.e., those that do not use auxiliary vector space, are inferior to the pattern recognition algorithms that rely on the vector approximation of the original, metric, recognition problem. The critical issues associated with the role of the auxiliary vector space representation for the metric pattern recognition problem are considered. Keywords: Pattern recognition in Metric Spaces, Efficiency, Auxiliary Vector Representation. | |
dc.description.copyright | Copyright @ Lev Goldfarb, 1990. | |
dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14861 | |
dc.rights | http://purl.org/coar/access_right/c_abf2 | |
dc.subject.discipline | Computer Science | |
dc.title | Why do we need the auxiliary vector representation for the metric pattern recognition problem? | |
dc.type | technical report |
Files
Original bundle
1 - 1 of 1