Unsupervised representation learning with minimax distance measures

DOI10.1007/s10994-020-05886-4OpenAlexW3045759936MaRDI QIDQ2217399

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

zbMATH Keywords

distance measurecomputational efficiencyrepresentation learningminimax distances

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Online learning of network bottlenecks via minimax paths

Uses Software

• UCI-ml
• LMNN

Cites Work

• 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
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
• Kernel methods in machine learning
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Robust path-based spectral clustering
• On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in Hilbert space
• Ultrametric sets in Euclidean point spaces
• Factor graphs and the sum-product algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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