Finding the optimal metric in classification problems with ordinal features

DOI10.1134/S0965542510030176MaRDI QIDQ2995851zbMATH OpenFDO

Authors G. V. Iofina

Publication date 4 May 2011

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542510030176

zbMATH Keywords

classification problemlinear programmingmetric algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 2099989
• Simultaneous Selection of Features and Metric for Optimal Nearest Neighbor Classification
• An Optimal Global Nearest Neighbor Metric
• Exploitation of pairwise class distances for ordinal classification
• Adaptive metric learning vector quantization for ordinal classification

Cited in

(5)

• Feature-wise differential evolution classifier with an OWA-based multi-distance aggregation
• Recovering a metric from its full ordinal information
• Adaptive metric learning vector quantization for ordinal classification
• Simultaneous Selection of Features and Metric for Optimal Nearest Neighbor Classification
• Lens depth function and \(k\)-relative neighborhood graph: versatile tools for ordinal data analysis

This page was built for publication: Finding the optimal metric in classification problems with ordinal features

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995851)