Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
From MaRDI portal
Publication:2290336
Recommendations
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Dissimilarity representations allow for building good classifiers
- Graph Embedding in Vector Spaces by Means of Prototype Selection
- scientific article; zbMATH DE number 1196641 (Why is no real title available?)
- Learning Similarities from Examples Under the Evidence Accumulation Clustering Paradigm
- Prototype selection for dissimilarity-based classifiers
- Similarity-based pattern analysis and recognition
- The Dissimilarity Representation for Pattern Recognition
Cited in
(4)- A review on distance based time series classification
- Dissimilarity-based classification of multidimensional signals by conjoint elastic matching: application to phytoplanktonic species recognition
- Discriminative Transformation for Multi-dimensional Temporal Sequences
- scientific article; zbMATH DE number 4185082 (Why is no real title available?)
This page was built for publication: Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290336)