Indefinite proximity learning: a review

DOI10.1162/NECO_A_00770zbMATH Open1472.68155DBLPjournals/neco/SchleifT15OpenAlexW1902477907WikidataQ38575045 ScholiaQ38575045MaRDI QIDQ5380326FDOQ5380326

Authors: Frank-Michael Schleif, Peter Tino 

Publication date: 4 June 2019

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1162/neco_a_00770

Recommendations

• Metric learning: a survey
• Metric Learning
• Similarity-based classification: concepts and algorithms
• Structural, Syntactic, and Statistical Pattern Recognition
• Non-linear metric learning using pairwise similarity and dissimilarity constraints and the geometrical structure of data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Visualizing non-metric similarities in multiple maps
• Visualizing data using t-SNE
• Title not available (Why is that?)
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• An introduction to support vector machines and other kernel-based learning methods.
• Information retrieval perspective to nonlinear dimensionality reduction for data visualization
• Dynamic programming algorithm optimization for spoken word recognition
• 10.1162/15324430152748236
• Title not available (Why is that?)
• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• The Dissimilarity Representation for Pattern Recognition
• Prototype selection for dissimilarity-based classifiers
• Similarity-based classification: concepts and algorithms
• 10.1162/15324430260185592
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Computing a nearest symmetric positive semidefinite matrix
• Learning the kernel matrix with semidefinite programming
• Radial Basis Functions
• Kernels and distances for structured data
• Clustering by Compression
• Encyclopedia of Distances
• Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
• A theory of learning with similarity functions
• Support vector machine classification with indefinite kernels
• Nonlinear Dimensionality Reduction
• Some remarks on reproducing kernel Krein spaces
• Title not available (Why is that?)
• Framework for kernel regularization with application to protein clustering
• Topographic mapping of large dissimilarity data sets
• Sparser Johnson-Lindenstrauss transforms
• A general framework for dimensionality-reducing data visualization mapping
• On the information and representation of non-Euclidean pairwise data
• Guaranteed Classification via Regularized Similarity Learning
• Dissimilarity representations allow for building good classifiers
• A unified approach to pattern recognition
• Edit distance-based kernel functions for structural pattern classification
• Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
• h‐plots for displaying nonmetric dissimilarity matrices
• Non-Euclidean dissimilarities: causes, embedding and informativeness
• Structural, Syntactic, and Statistical Pattern Recognition
• Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
• The Metric Nearness Problem
• Indefinite kernel discriminant analysis
• About the non-convex optimization problem induced by non-positive semidefinite kernel learning
• Theory and Algorithm for Learning with Dissimilarity Functions
• Online Kernel Slow Feature Analysis for Temporal Video Segmentation and Tracking

Cited In (19)

• Similarity, kernels, and the fundamental constraints on cognition
• Distributed robust regression with correntropy losses and regularization kernel networks
• Nyström subsampling method for coefficient-based regularized regression
• Distributed learning with indefinite kernels
• Title not available (Why is that?)
• Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints
• Feature discovery in non-metric pairwise data
• Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context
• A feasible \(k\)-means kernel trick under non-Euclidean feature space
• Title not available (Why is that?)
• Analysis of regularized least-squares in reproducing kernel Kreĭn spaces
• Coefficient-based regularized distribution regression
• Title not available (Why is that?)
• Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
• Nyström-based approximate kernel subspace learning
• Indefinite kernels in least squares support vector machines and principal component analysis
• Pairwise learning problems with regularization networks and Nyström subsampling approach
• Optimal rates for coefficient-based regularized regression
• Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms

Uses Software

• t-SNE
• ExPASy

This page was built for publication: Indefinite proximity learning: a review

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