Database Paper Browser

Back to papers

Scalable Kernel Density Classification via Threshold-Based Pruning

Summary: Threshold-based pruning for KDE density classification (tKDC): iteratively compute density bounds and short-circuit KDE when bounds cross the target threshold. Maintains accuracy guarantees while delivering asymptotic speedups (up to 1000x) across diverse datasets and dimensions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5411
Venue
SIGMOD
Year
2017
Pagerank
6.0668364e-05
Overall Rank
4,584 | 68.12%
DOI
10.1145/3035918.3064035

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
161 LOF: Identifying Density-Based Local Outliers 2000 SIGMOD 0.00039846974
701 Efficient Algorithms for Mining Outliers from Large Data Sets 2000 SIGMOD 0.00017938417
761 Materialization Optimizations for Feature Selection Workloads 2014 SIGMOD 0.00017053783
2,126 MacroBase: Prioritizing Attention in Fast Data 2017 SIGMOD 9.4887794e-05
3,313 Quality and Efficiency in Kernel Density Estimates for Large Data 2013 SIGMOD 7.2381634e-05
Previous Page 1 / 1 Next

Semantically Similar Papers