While I haven't looked in depth at either post I find this to be an awfully bold claim and appears to be based on the results of a small number of example probl

While I haven't looked in depth at either post I find this to be an awfully bold claim and appears to be based on the results of a small number of example problems. There are probably hundreds of papers available where the opposite is shown to be true. In fact, many come to the conclusion that more data approaches an asymptote for performance of a given algorithm, where implementation of a new algorithm or using an ensemble classifier may substantially increase performance.