Ordinal regression with explainable distance metric learning based on ordered sequences

DOI10.1007/S10994-021-06010-WOpenAlexW3178526909MaRDI QIDQ2071504FDOQ2071504

Authors: Juan Luis Suárez, S. G. Garcia, Francisco Herrera 

Publication date: 28 January 2022

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-021-06010-w

zbMATH Keywords

nearest neighborsordinal regressiondistance metric learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Distance metric learning for large margin nearest neighbor classification
• Visualizing data using t-SNE
• Joint maximization of accuracy and information for learning the structure of a Bayesian network classifier
• Principal component analysis.
• rNPBST
• Nearest neighbor pattern classification
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Analysis of ordinal categorical data.
• Title not available (Why is that?)
• Support Vector Ordinal Regression
• Concordance probability and discriminatory power in proportional hazards regression
• V-shaped interval insensitive loss for ordinal classification
• Title not available (Why is that?)
• Optimal Latin-hypercube designs for computer experiments
• Title not available (Why is that?)
• Aggregation functions based on penalties
• Reduction from cost-sensitive ordinal ranking to weighted binary classification
• Supervised distance metric learning through maximization of the Jeffrey divergence

Cited In (1)

• Ordinal regression based on learning vector quantization

Uses Software

• KEEL
• t-SNE
• ORCA
• LMNN
• extended_rmcv.m
• pyDML
• rNPBST

This page was built for publication: Ordinal regression with explainable distance metric learning based on ordered sequences

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