Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases

DOI10.1007/s11590-015-0948-6zbMath1367.62193OpenAlexW1639550283MaRDI QIDQ526417

Andrey V. Savchenko

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0948-6

zbMATH Keywords

image recognitionexponential familystatistical classificationapproximate nearest neighbor methodKullback-Leibler discrimination

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• SIFT
• DeepFace

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decision rules for efficient classification of biological data
• The \(p\)-median problem: a survey of metaheuristic approaches
• One-dimensional center-based l 1-clustering method
• On the optimization properties of the correntropic loss function in data analysis
• Face recognition from a single image per person: a survey
• Mining market data: a network approach
• Handbook of Face Recognition
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• An efficient algorithm for a complete link method
• Pivot selection techniques for proximity searching in metric spaces
• Data Mining
• Using Supervised Clustering to Enhance Classifiers
• Testing Statistical Hypotheses
• Computer Vision

This page was built for publication: Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases