Density estimation from unweighted k-nearest neighbor graphs: a roadmapDensity estimation from unweighted k-nearest neighbor graphs: a roadmapvon Luxburg, Ulrike and Alamgir, Morteza2013
Paper summarynipsreviewsA method of estimating a density (up to constants) from an unweighted, directed k nearest neighbor graph is described. It is assumed (more or less) that the density is continuously differentiable, supported on a compact and connected subset of $R^d$ with non-empty interior and a smooth boundary, and is upper- and lower-bounded on its support.
A method of estimating a density (up to constants) from an unweighted, directed k nearest neighbor graph is described. It is assumed (more or less) that the density is continuously differentiable, supported on a compact and connected subset of $R^d$ with non-empty interior and a smooth boundary, and is upper- and lower-bounded on its support.