Fast randomized algorithms for robust estimation of location
A fundamental procedure appearing within such clustering methods as \(k\)-Means, Expectation Maximization, Fuzzy-C-Means and Minimum Message Length is that of computing estimators of location. Most estimators of location exhibiting useful robustness properties require at least quadratic time to compute, far too slow for large data mining applications. In this paper, we propose \(O(Dn\sqrt{n})\)-time randomized algorithms for computing robust estimators of location, where \(n\) is the size of the data set, and \(D\) is the dimension. For the entire collection see [Zbl 0976.68582].
- A fast algorithm for highly robust regression in data mining
- Approximating the distribution of the median and other robust estimators on uncertain data
- Fast recursive and efficient algorithms for estimating the functional median and robust clustering in large dimension
- Finding approximate solutions to combinatorial problems with very large data sets using BIRCH
This page was built for publication: Fast randomized algorithms for robust estimation of location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777822)