2007 · 29 citations · 21 references
ComputingCommunicationComputer ScienceDistributed SystemsMachine LearningStatistical LearningDensity EstimationDistributed AlgorithmsDistributed ComputingDistributed Data ProcessingDistributed LearningKernel Density EstimationDistributed Machine LearningFast Kernel Density EstimationGossip AlgorithmsKernel-based EstimationNonparametric Density EstimationParametric EstimationStorageStorage Overhead Optimization
Learning the underlying model from distributed data is often useful for many distributed systems. In this paper, we study the problem of learning a non-parametric model from distributed observations. We propose a gossip-based distributed kernel density estimation algorithm and analyze the convergence and consistency of the estimation process. Furthermore, we extend our algorithm to distributed systems under communication and storage constraints by introducing a fast and efficient data reduction algorithm. Experiments show that our algorithm can estimate underlying density distribution accurately and robustly with only small communication and storage overhead.
21
On Information and Sufficiency
S. Kullback, R. A. Leibler · The Annals of Mathematical Statistics · 1951 · 20K citations · Full text
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
Robust Regression and Outlier Detection
Gregory F. Piepel, Peter J. Rousseeuw, Annick M. Leroy · Technometrics · 1989 · 6.2K citations
Stephen Boyd, Aritra Ghosh, Balaji Prabhakar et al. · IEEE Transactions on Information Theory · 2006 · 2.5K citations