Indefinite Proximity Learning: A Review
From MaRDI portal
Publication:5380326
DOI10.1162/NECO_A_00770zbMath1472.68155DBLPjournals/neco/SchleifT15OpenAlexW1902477907WikidataQ38575045 ScholiaQ38575045MaRDI QIDQ5380326
Peter Tiňo, Frank-Michael Schleif
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
Related Items (17)
Unnamed Item ⋮ Indefinite kernels in least squares support vector machines and principal component analysis ⋮ Nyström-based approximate kernel subspace learning ⋮ Coefficient-based regularized distribution regression ⋮ Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms ⋮ Applicability and interpretability of Ward's hierarchical agglomerative clustering with or without contiguity constraints ⋮ A feasible \(k\)-means kernel trick under non-Euclidean feature space ⋮ Pairwise learning problems with regularization networks and Nyström subsampling approach ⋮ Nyström subsampling method for coefficient-based regularized regression ⋮ Analysis of regularized least-squares in reproducing kernel Kreĭn spaces ⋮ Distributed learning with indefinite kernels ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Optimal rates for coefficient-based regularized regression ⋮ Unnamed Item ⋮ Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context ⋮ Similarity, kernels, and the fundamental constraints on cognition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Visualizing non-metric similarities in multiple maps
- Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
- Kernels and distances for structured data
- A unified approach to pattern recognition
- Dealing with non-metric dissimilarities in fuzzy central clustering algorithms
- A theory of learning with similarity functions
- Support vector machine classification with indefinite kernels
- Computing a nearest symmetric positive semidefinite matrix
- Some remarks on reproducing kernel Krein spaces
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- About the non-convex optimization problem induced by non-positive semidefinite kernel learning
- On the information and representation of non-Euclidean pairwise data
- Edit distance-based kernel functions for structural pattern classification
- Prototype selection for dissimilarity-based classifiers
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- A General Framework for Dimensionality-Reducing Data Visualization Mapping
- 10.1162/15324430260185592
- Topographic Mapping of Large Dissimilarity Data Sets
- Sparser Johnson-Lindenstrauss Transforms
- Indefinite Kernel Discriminant Analysis
- The Dissimilarity Representation for Pattern Recognition
- Clustering by Compression
- The Metric Nearness Problem
- Theory and Algorithm for Learning with Dissimilarity Functions
- Dynamic programming algorithm optimization for spoken word recognition
- Algorithms on Strings, Trees and Sequences
- 10.1162/15324430152748236
- Radial Basis Functions
- Dissimilarity representations allow for building good classifiers
- Online Kernel Slow Feature Analysis for Temporal Video Segmentation and Tracking
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- h‐plots for displaying nonmetric dissimilarity matrices
- Non-Euclidean Dissimilarities: Causes, Embedding and Informativeness
- Guaranteed Classification via Regularized Similarity Learning
- Framework for kernel regularization with application to protein clustering
- Nonlinear Dimensionality Reduction
- Structural, Syntactic, and Statistical Pattern Recognition
- Encyclopedia of Distances
This page was built for publication: Indefinite Proximity Learning: A Review
