Sparse Density Trees and Lists: An Interpretable Alternative to High-Dimensional Histograms
원문 초록
We present sparse tree-based and list-based density estimation methods for binary/categorical data. Our density estimation models are higher dimensional analogies to variable bin width histograms. In each leaf of the tree (or list), the density is constant, similar to the flat density within the bin of a histogram. Histograms, however, cannot easily be visualized in more than two dimensions, whereas our models can. The accuracy of histograms fades as dimensions increase, whereas our models have priors that help with generalization. Our models are sparse, unlike high-dimensional fixed-bin histograms. We present three generative modeling methods, where the first one allows the user to specify the preferred number of leaves in the tree within a Bayesian prior. The second method allows the user to specify the preferred number of branches within the prior. The third method returns density lists (rather than trees) and allows the user to specify the preferred number of rules and the length of rules within the prior. The new approaches often yield a better balance between sparsity and accuracy of density estimates than other methods for this task. We present an application to crime analysis, where we estimate how unusual each type of modus operandi is for a house break-in.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Binned semiparametric Bayesian networks
EBC-ZIP: Improving Blockwise Crowd Counting with Zero-Inflated Poisson Regression
Scaling-Up the Pretraining of the Earth Observation Foundation Model PhilEO to the MajorTOM Dataset
FunDiff: Diffusion Models over Function Spaces for Physics-Informed Generative Modeling
TabPFN: One Model to Rule Them All?
Querying Kernel Methods Suffices for Reconstructing their Training Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.