This study proposes a data condensation method for multivariate kernel density estimation by genetic algorithm. First, our proposed algorithm generates multiple subsamples of a given size with replacement from the original sample. The subsamples and their constituting data points are regarded as chromosome and gene, respectively, in the terminology of genetic algorithm. Second, each pair of subsamples breeds two new subsamples, where each data point faces either crossover, mutation, or reproduction with a certain probability. The dominant subsamples in terms of fitness values are inherited by the next generation. This process is repeated generation by generation and results in a kernel density estimator with sparse representation in its completion. We confirmed from simulation studies that the resulting estimator can perform better than other well-known density estimators.
展开▼
