The Dissimilarity Representation for Pattern Recognition

DOI10.1142/5965zbMATH Open1095.68105OpenAlexW1480708938MaRDI QIDQ3376046FDOQ3376046

Authors: Elżbieta Pȩkalska, Robert P. W. Duin 

Publication date: 20 March 2006

Published in: Series in Machine Perception and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/5965

Recommendations

• scientific article; zbMATH DE number 1717340
• Dissimilarity representations allow for building good classifiers
• A new method for similarity measures for pattern recognition
• scientific article; zbMATH DE number 2013269
• Pattern recognition by the method of pairwise template comparison in competent feature subspaces.
• Theory and Algorithm for Learning with Dissimilarity Functions

zbMATH Keywords

classificationdistancelearningdissimilarity

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Pattern recognition, speech recognition (68T10) Topological spaces and generalizations (closure spaces, etc.) (54A05)

Cited In (50)

• Title not available (Why is that?)
• Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
• Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies
• Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
• Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
• A review on distance based time series classification
• Improving classifier performance by using fictitious training data? A case study
• Graph ambiguity
• Recent advances in graph-based pattern recognition with applications in document analysis
• h‐plots for displaying nonmetric dissimilarity matrices
• On using prototype reduction schemes to optimize dissimilarity-based classification
• A comparison of two dissimilarity functions for mixed-type predictor variables in the \(\delta\)-machine
• Fidelity-commensurability tradeoff in joint embedding of disparate dissimilarities
• Mathematical characterization of sophisticated variants for relevance learning in learning matrix quantization based on Schatten-\(p\)-norms
• Sparse conformal prediction for dissimilarity data
• A feasible \(k\)-means kernel trick under non-Euclidean feature space
• Distances between sets based on set commonality
• Indefinite proximity learning: a review
• Large width nearest prototype classification on general distance spaces
• Dissimilarity between two skeletal trees in a context
• An improved analysis of local search for max-sum diversification
• Scaled Torus Principal Component Analysis
• Compactness Hypothesis, Potential Functions, and Rectifying Linear Space in Machine Learning
• Regularized multidimensional scaling with radial basis functions
• Building the library of RNA 3D nucleotide conformations using the clustering approach
• Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
• Indefinite kernel discriminant analysis
• Prototype selection for dissimilarity-based classifiers
• Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
• On the relationship between positive semi-definite matrices and t-norms
• Discriminant analysis of regularized multidimensional scaling
• Metric correctness of pairwise comparisons in intelligent data analysis
• COBRA: a combined regression strategy
• Visualizing non-metric similarities in multiple maps
• Graph classification and clustering based on vector space embedding.
• Ricci flow embedding for rectifying non-Euclidean dissimilarity data
• Improving bipartite graph edit distance approximation using various search strategies
• Gram matrix associated to controlled frames
• Non-Euclidean dissimilarities: causes, embedding and informativeness
• Hierarchical graph embedding in vector space by graph pyramid
• Learning half-spaces on general infinite spaces equipped with a distance function
• Compound Objects Comparators in Application to Similarity Detection and Object Recognition
• Central limit theorems for classical multidimensional scaling
• The \(\delta \)-machine: classification based on distances towards prototypes
• Dynamic selection of generative-discriminative ensembles for off-line signature verification
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Methods for the combination of kernel matrices within a support vector framework
• The graph matching problem
• Modeling the uncertainty of a set of graphs using higher-order fuzzy sets
• Title not available (Why is that?)

This page was built for publication: The Dissimilarity Representation for Pattern Recognition

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