We study consistency of learning algorithms for a multi-class performance metric that is anon-decomposable function of the confusion matrix of a classifier and cannot be expressed asa sum of losses on individual data points; examples of such performance metrics include themicro and macro F-measure used widely in information retrieval and the multi-class G-meanmetric popular in c...

The notion of sequential and parallel decomposition of a language over a set of languages was introduced by Schnoebelen. A language is decomposable if it belongs to a finite set of languages S such that each member of S admits a sequential and parallel decomposition over S. We disprove a conjecture of Schnoebelen concerning decomposable languages and establish some new properties of these langu...

A tree T is arbitrarily vertex decomposable if for any sequence of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by . An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. © 2007 Elsevier B.V. All rights reserved.

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells that an n-vector (n ≥ 3) is decomposable iff all its contractions with up to n− 2 covectors are decomposable. In the last years, several authors have studied g...

A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells that an n-vector (n ≥ 3) is decomposable iff all its contractions with up to n − 2 covectors are decomposable. In the last years, several authors have studied ...

decomposability of an algebraic structure into the :union: of its sub-structures goes back to g. scorza's theorem of 1926 for groups. an analogue of this theorem for rings has been recently studied by a. lucchini in 2012. on the study of this problem for non-group semigroups, the first attempt is due to clifford's work of 1961 for the regular semigroups. since then, n.p. mukherjee in ...

The main result of this paper completely settles Bermond's conjecture for bipartite graphs of odd degree by proving that if G is a bipartite (2k+1)-regular graph that is Hamilton decomposable, then the line graph, L(G), of G is also Hamilton decomposable. A similar result is obtained for 5-regular graphs, thus providing further evidence to support Bermond's conjecture.

We extend F.Pastjin's construction of uniform decomposable chains of finite rank to those of rank 'finite over a limit' and investigate infinite (length ω) products and unions of such chains. We derive an extension of Pastjin's characterisation to uniform decomposable chains of small transfinite rank (≤ ω + ω).

In this paper we translate Ramsey-type problems into the language of decomposable hereditary properties of graphs. We prove a distribu-tive law for reducible and decomposable properties of graphs. Using it we establish some values of graph theoretical invariants of decompos-able properties and show their correspondence to generalized Ramsey numbers.