Unsupervised representation learning with minimax distance measures

DOI10.1007/S10994-020-05886-4MaRDI QIDQ2217399zbMATH OpenOpenAlexFDO

Authors Morteza Haghir Chehreghani

Publication date 29 December 2020

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

computational efficiencydistance measurerepresentation learningminimax distances

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

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

Cites work

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

Cited in

(4)

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

Describes a project that uses

Uses Software

• UCI
• 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)