Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
Consider the following problem: given sets of unlabeled observations, each set with known label proportions, predict the labels of another set of observations, also with known lab...
Alex J. Smola, Novi Quadrianto, Quoc V. Le, Tib&ea...
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Abstract. This paper presents a strategy of dynamic user modeling for sketchbased user interface. A user model is defined as an incremental decision tree for a specific user. A dra...
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...