Related papers: Forests whose matching powers are linear

This paper considers the problem of choosing a good classifier. For each problem there exist an optimal classifier, but none are optimal, regarding the error rate, in all cases. Because there exists a large number of classifiers, a user…

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…

Evans defines a notion of what it means for a set B to be polar for a process indexed by a tree. The main result herein is that a tree picked from a Galton-Watson measure whose offspring distribution has mean m and finite variance will…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

Random forests are classical ensemble algorithms that construct multiple randomized decision trees and aggregate their predictions using naive averaging. \citet{zhou2019deep} further propose a deep forest algorithm with multi-layer forests,…

A grammar-compressed ranked tree is represented with a linear space overhead so that a single traversal step, i.e., the move to the parent or the i-th child, can be carried out in constant time. Moreover, we extend our data structure such…

While balancing covariates between groups is central for observational causal inference, selecting which features to balance remains a challenging problem. Kernel balancing is a promising approach that first estimates a kernel that captures…

We describe all weights which are appropriated for the unitarization of linear representations of primitive partially ordered sets of finite type.

This work introduces a transformation-based learner model for classification forests. The weak learner at each split node plays a crucial role in a classification tree. We propose to optimize the splitting objective by learning a linear…

For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…

Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and…

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…

We develop Clustered Random Forests, a random forests algorithm for clustered data, arising from independent groups that exhibit within-cluster dependence. The leaf-wise predictions for each decision tree making up clustered random forests…

We define ''convergence'' for noncommutative power series and construct two topologies on the algebra of power series, convergent with respect to a positive radius. We indicate all finite dimensional continuous representations of this…

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be…

In this article, we discuss the vertex decomposability of three well-studied simplicial complexes associated to forests. In particular, we show that the bounded degree complex of a forest and the complex of directed trees of a multidiforest…

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…

The problem of all-relevant feature selection is concerned with finding a relevant feature set with preserved redundancies. There exist several approximations to solve this problem but only one could give a distinction between strong and…

This paper outlines a method to determine whether two label-regular directed trees, are isomorphic and when they are almost isomorphic. The approach involves reinterpreting label-regular directed trees as universal covers of rooted graphs.…