Indefinite proximity learning: a review
From MaRDI portal
Publication:5380326
Recommendations
Cites work
- 10.1162/15324430152748236
- 10.1162/15324430260185592
- A general framework for dimensionality-reducing data visualization mapping
- A theory of learning with similarity functions
- A unified approach to pattern recognition
- About the non-convex optimization problem induced by non-positive semidefinite kernel learning
- Algorithms on Strings, Trees and Sequences
- An introduction to support vector machines and other kernel-based learning methods.
- Clustering by Compression
- Computing a nearest symmetric positive semidefinite matrix
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- Dissimilarity representations allow for building good classifiers
- Dynamic programming algorithm optimization for spoken word recognition
- Edit distance-based kernel functions for structural pattern classification
- Encyclopedia of Distances
- Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
- Framework for kernel regularization with application to protein clustering
- Guaranteed Classification via Regularized Similarity Learning
- scientific article; zbMATH DE number 5286897 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- h‐plots for displaying nonmetric dissimilarity matrices
- Indefinite kernel discriminant analysis
- Information retrieval perspective to nonlinear dimensionality reduction for data visualization
- Kernels and distances for structured data
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning the kernel matrix with semidefinite programming
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Non-Euclidean dissimilarities: causes, embedding and informativeness
- Nonlinear Dimensionality Reduction
- On the information and representation of non-Euclidean pairwise data
- Online Kernel Slow Feature Analysis for Temporal Video Segmentation and Tracking
- Prototype selection for dissimilarity-based classifiers
- Radial Basis Functions
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- Similarity-based classification: concepts and algorithms
- Some remarks on reproducing kernel Krein spaces
- Sparser Johnson-Lindenstrauss transforms
- Structural, Syntactic, and Statistical Pattern Recognition
- Support vector machine classification with indefinite kernels
- The Dissimilarity Representation for Pattern Recognition
- The Metric Nearness Problem
- Theory and Algorithm for Learning with Dissimilarity Functions
- Topographic mapping of large dissimilarity data sets
- Visualizing data using t-SNE
- Visualizing non-metric similarities in multiple maps
Cited in
(21)- A feasible \(k\)-means kernel trick under non-Euclidean feature space
- Analysis of regularized least-squares in reproducing kernel Kreĭn spaces
- Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints
- Optimal rates for coefficient-based regularized regression
- Indefinite kernels in least squares support vector machines and principal component analysis
- Nyström-based approximate kernel subspace learning
- Similarity, kernels, and the fundamental constraints on cognition
- Feature discovery in non-metric pairwise data
- Nyström subsampling method for coefficient-based regularized regression
- Learning data-adaptive non-parametric kernels
- Minimal learning machine: theoretical results and clustering-based reference point selection
- Generalization properties of hyper-RKHS and its applications
- Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
- Distributed learning with indefinite kernels
- Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context
- Coefficient-based regularized distribution regression
- Pairwise learning problems with regularization networks and Nyström subsampling approach
- Distributed robust regression with correntropy losses and regularization kernel networks
- Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms
- Online landmark replacement for out-of-sample dimensionality reduction methods
- L₁-norm regularized indefinite kernel logistic regression
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)
