arXiv research

Three methods combine one-class classifiers with MST-CD and N-ary Trees for binary classification.

We propose an extension of n-ary Nambu-Poisson bracket to superspace R^{n|m} and construct by means of superdeterminant a family of Nambu-Poisson algebras of even degree functions, where the parameter of this family is an invertible transformation of Grassmann coordinates in superspace R^{n|m}. We prove in the case of …

We study $n$-ary commutative superalgebras and $L_{\infty}$-algebras that possess a skew-symmetric invariant form, using the derived bracket formalism. This class of superalgebras includes for instance Lie algebras and their $n$-ary generalizations, commutative associative and Jordan algebras with an invariant form. We…

Recurrent neural networks (RNNs) process input text sequentially and model the conditional transition between word tokens. In contrast, the advantages of recursive networks include that they explicitly model the compositionality and the recursive structure of natural language. However, the current recursive architectur…

These notes are devoted to the multiple generalization of a Lie algebra introduced by A.M.Vinogradov and M.M.Vinogradov. We compare definitions of such algebras in the usual and invariant case. Furthermore, we show that there are no simple $n$-ary Lie algebras of type $(n-1,l)$ for $l>0$.

Study cohomology spaces of sl(2) acting on n-ary differential operators.

We show that one can skip the skew-symmetry assumption in the definition of Nambu-Poisson brackets. In other words, a n-ary bracket on the algebra of smooth functions which satisfies the Leibniz rule and a n-ary version of the Jacobi identity must be skew-symmetric. A similar result holds for a non-antisymmetric versio…

A C-infinity ring is a set equipped with n-ary operations corresponding to smooth n-ary functions on the real line (satisfying natural axioms). We prove that the cosimplicial abelian group associated to the de Rham complex of Euclidean space has the structure of a cosimplicial C-infinity ring. We also analyse the notio…

Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.

Extends graph theory to hypergraphs with manifold-valued nodes.

The method of double extension, introduced by A.~Medina and Ph.~Revoy, is a procedure which decomposes a Lie algebra with an invariant symmetric form into elementary pieces. Such decompositions were developed for other algebras, for instance for Lie superalgebras and associative algebras, Filippov $n$-algebras and Jord…

We are interested in the study of the space of $n$-ary differential operators denoted by $\mathfrak{D}_{\underlineł,μ}$ where $\underlineł=(ł_{1},...,ł_{n})$ acting on weighted densities from $\frak F_{ł_1}\otimes\frak F_{ł_2}\otimes...\otimes\frak F_{ł_n}$ to $\frak F_μ$ as a module over the orthosymplectic superalgeb…

This paper investigates higher order generalizations of well known results for Lie algebroids and bialgebroids. It is proved that $n$-Lie algebroid structures correspond to $n$-ary generalization of Gerstenhaber algebras and are implied by $n$-ary generalization of linear Poisson structures on the dual bundle. A Nambu-…

This research classifies deformations of Yang-Baxter operators using cohomology of $n$-Lie algebras.

New algebraic structures extend Courant algebroids to higher multi-Courant algebroids.

The paper analyzes binary option markets with exogenous information and price sensitivity.

We discuss relations between linear Nambu-Poisson structures and Filippov algebras and define Filippov algebroids which are n-ary generalizations of Lie algebroids. We also prove results describing multiplicative Nambu- Poisson structures on Lie groups. In particular, we show that simple Lie groups do not admit multipl…

Generalizations in many directions of the contraction procedure for Lie algebras introduced by E.J.Saletan are proposed. Products of arbitrary nature, not necessarily Lie brackets, are considered on sections of finite-dimensional vector bundles. Saletan contractions of such infinite-dimensional algebras are obtained vi…

Definition of frustration is expressed by transitivity of binary entanglement relation in considered complex system. Extending this definition into n-ary relation a hierarchy of frustrations is derived. As a complex system the U.S. Intermarket is chosen where the correlation coefficient of intermarket sectors plays the…

We investigate constructions of higher arity self-distributive operations, and give relations between cohomology groups corresponding to operations of different arities. For this purpose we introduce the notion of mutually distributive $n$-ary operations generalizing those for the binary case, and define a cohomology t…

Characterizes Filippov n-algebroids using connections and formulas.

A notion of n-Lie algebra introduced by V.T. Filippov can be viewed as a generalization of a concept of binary Lie algebra to the algebras with n-ary multiplication law. A notion of Lie algebra can be extended to Z_2-graded structures giving a notion of Lie superalgebra. Analogously a notion of n-Lie algebra can be ext…

Boosting meta-trees improve decision tree performance.

The paper studies geometric properties of quasi-trees and tree approximations.

Efficiently updates posterior tree distributions over meta-trees.

This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for preferring the multiple tree approach. Ideally, we would like to consider predictio…

We introduce a novel incremental decision tree learning algorithm, Hoeffding Anytime Tree, that is statistically more efficient than the current state-of-the-art, Hoeffding Tree. We demonstrate that an implementation of Hoeffding Anytime Tree---"Extremely Fast Decision Tree", a minor modification to the MOA implementat…

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

This paper introduces TNTK to study infinite soft tree ensembles.

Paper analyzes soft tree ensembles using NTK, finding only leaf count matters.

Researchers improve tree model recovery from noisy data.

Optimal survival trees ensemble reduces tree count and improves predictive performance.

Width trees link link invariants and bridge number.

Paper studies ensemble probabilistic regression trees for smooth approximations.

The task of translating between programming languages differs from the challenge of translating natural languages in that programming languages are designed with a far more rigid set of structural and grammatical rules. Previous work has used a tree-to-tree encoder/decoder model to take advantage of the inherent tree s…

Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly trained with backpropagation, like a neural network. Even though this continuity …

Characterizes fundamental groups of disjointly tree-graded spaces.

SBT model uses randomized sharding and sub-models to improve Bayesian Additive Regression Trees.

Decision Machines embeds decision trees into vector spaces for improved optimization.

Trees and their products compared to octahedron.

Tree Index evaluates cluster quality by creating decision trees from data.

TES-AE uses tree grammars to speed up autoencoding for tree data.

Flexible tree ensemble learning framework supports arbitrary loss functions and multi-task learning.

Kauri is a novel unsupervised binary tree for clustering that outperforms existing methods.

HATT improves online decision tree ensembles by using a more eager splitting strategy.

We introduce the concept of community trees that summarizes topological structures within a network. A community tree is a tree structure representing clique communities from the clique percolation method (CPM). The community tree also generates a persistent diagram. Community trees and persistent diagrams reveal topol…

Optimal Survival Trees improve accuracy in medical data analysis.

A novel tree algorithm improves time series forecasting accuracy.