A dynamic data structure maintains approximate kernel density estimates for all query points and a sparse similarity graph under point insertions, with n^(1/4+o(1)) amortized update time for the Gaussian kernel.
P., Whitman, B., and Lamere, P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Similarity Graph Construction with Kernel Density Estimation
A dynamic data structure maintains approximate kernel density estimates for all query points and a sparse similarity graph under point insertions, with n^(1/4+o(1)) amortized update time for the Gaussian kernel.