Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes
From MaRDI portal
Publication:2290336
DOI10.1016/j.patcog.2016.11.013zbMath1429.68261OpenAlexW2550600492MaRDI QIDQ2290336
Volkmar Frinken, Seiichi Uchida, Brian Kenji Iwana, Kaspar Riesen
Publication date: 27 January 2020
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2016.11.013
dissimilarity representationensemble classificationtemporal patternsdissimilarity space embeddingonline digit classification
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Similarity-based pattern analysis and recognition
- A decision-theoretic generalization of on-line learning and an application to boosting
- Prototype selection for dissimilarity-based classifiers
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- The Dissimilarity Representation for Pattern Recognition
- Dissimilarity representations allow for building good classifiers
- Learning Similarities from Examples Under the Evidence Accumulation Clustering Paradigm
- Graph Embedding in Vector Spaces by Means of Prototype Selection
This page was built for publication: Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes