A K-Means, Ward and DBSCAN repeatability study
By: Anthony Bertrand , Engelbert Mephu Nguifo , Violaine Antoine and more
Reproducibility is essential in machine learning because it ensures that a model or experiment yields the same scientific conclusion. For specific algorithms repeatability with bitwise identical results is also a key for scientific integrity because it allows debugging. We decomposed several very popular clustering algorithms: K-Means, DBSCAN and Ward into their fundamental steps, and we identify the conditions required to achieve repeatability at each stage. We use an implementation example with the Python library scikit-learn to examine the repeatable aspects of each method. Our results reveal inconsistent results with K-Means when the number of OpenMP threads exceeds two. This work aims to raise awareness of this issue among both users and developers, encouraging further investigation and potential fixes.
Similar Papers
Reproducibility of Machine Learning-Based Fault Detection and Diagnosis for HVAC Systems in Buildings: An Empirical Study
Machine Learning (CS)
Makes science experiments easier to check.
Rethink Repeatable Measures of Robot Performance with Statistical Query
Robotics
Makes robot tests give the same results always.
Approximate Replicability in Learning
Machine Learning (CS)
Makes computer learning work even with messy data.