Graph Matching Networks Meet Optimum-Path Forest: How to Prune Ensembles Efficiently
- 4 December 2024
- book chapter
- Published by Springer Nature
- p. 1-18
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Canonical cortical graph neural networks and its application for speech enhancement in audio-visual hearing aidsNeurocomputing, 2022
- Handling imbalanced datasets through Optimum-Path ForestKnowledge-Based Systems, 2022
- Novel clustering-based pruning algorithmsPattern Analysis and Applications, 2020
- Margin & diversity based ordering ensemble pruningNeurocomputing, 2018
- A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching2017
- Alternating Direction Graph Matching2017
- Spectral clustering for divide-and-conquer graph matchingParallel Computing, 2015
- Efficient supervised optimum-path forest classification for large datasetsPattern Recognition, 2012
- Data clustering as an optimum‐path forest problem with applications in image analysisInternational Journal of Imaging Systems and Technology, 2009
- Supervised pattern classification based on optimum‐path forestInternational Journal of Imaging Systems and Technology, 2009