Unsupervised representation learning with minimax distance measures

DOI10.1007/S10994-020-05886-4OpenAlexW3045759936MaRDI QIDQ2217399FDOQ2217399

Authors: Morteza Haghir Chehreghani 

Publication date: 29 December 2020

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

Full work available at URL: https://arxiv.org/abs/1904.13223

Recommendations

• Survey on distance metric learning and dimensionality reduction in data mining
• Distance metric learning by minimal distance maximization
• Distance metric learning by knowledge embedding
• Metric Learning
• Metric learning: a survey

zbMATH Keywords

computational efficiencydistance measurerepresentation learningminimax distances

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Distance metric learning for large margin nearest neighbor classification
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on two problems in connexion with graphs
• Introduction to algorithms
• Kernel methods in machine learning
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• Euclidean embedding of co-occurrence data
• Numerical mathematics.
• On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Factor graphs and the sum-product algorithm
• Adaptive trajectory analysis of replicator dynamics for data clustering
• Title not available (Why is that?)
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Robust path-based spectral clustering
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Ultrametric sets in Euclidean point spaces

Cited In (3)

• Parametric UMAP Embeddings for Representation and Semisupervised Learning
• Minimal model of permutation symmetry in unsupervised learning
• Online learning of network bottlenecks via minimax paths

Uses Software

• UCI-ml
• LMNN

This page was built for publication: Unsupervised representation learning with minimax distance measures

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