A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES

DOI10.1142/S1469026809002461zbMath1178.68627OpenAlexW2169218196MaRDI QIDQ3631253

Thomas M. Breuel, Oliver Wirjadi

Publication date: 5 June 2009

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1469026809002461

zbMATH Keywords

Parzen windowmode finding

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Related Items (1)

Bridging formal methods and machine learning with model checking and global optimisation

Uses Software

• PRMLT

Cites Work

• Unnamed Item
• A Branch and Bound Clustering Algorithm
• On the use of interval arithmetic in geometric branch and bound algorithms

This page was built for publication: A BRANCH AND BOUND ALGORITHM FOR FINDING THE MODES IN KERNEL DENSITY ESTIMATES