A novel classification algorithm based on the synergy between dynamic clustering with adaptive distances and K-nearest neighbors

DOI10.1007/S00357-024-09471-5MaRDI QIDQ6605869FDOQ6605869

Authors: Mohammed Sabri, Rosanna Verde, Antonio Balzanella, Fabrizio Maturo, Hamid Tairi, Ali Yahyaouy, Jamal Riffi 

Publication date: 16 September 2024

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

dynamic clusteringadaptive distancescombinatorial classificationK-nearest neighbors

Mathematics Subject Classification ID

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

Cites Work

• Stochastic gradient boosting.
• An optimization algorithm for clustering using weighted dissimilarity measures
• Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
• Partitional clustering algorithms for symbolic interval data based on single adaptive distances
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A nearest-neighbor search model for distance metric learning
• Batch self-organizing maps for distributional data with an automatic weighting of variables and components
• A stacking weighted \(k\)-nearest neighbour with thresholding
• Combining unsupervised and supervised learning techniques for enhancing the performance of functional data classifiers

This page was built for publication: A novel classification algorithm based on the synergy between dynamic clustering with adaptive distances and K-nearest neighbors

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