ویراساینس.
سند علمی

A Complete Characterisation of the Classification Tree Problem

Pierre Flener, Xavier Lorca

چکیده

Finding a classification tree over a given set of elements that is compatible with a given family of classification trees over subsets of that set is a common problem in many application areas, such as the historical analysis of languages, the theory of relational databases, and phylogenetic supertree construction. We present a constraint programming approach to this problem. First, we introduce a natural and compact graph representation of a family of classification trees. Second, we provide a complete filtering algorithm for the classification tree problem, based on this normal form.

اسناد مشابه

  • Binary Classification Trees for Multi-class Classification Problems

    سند علمی۲۰۰۳ICDARJin-Seon Lee, Il-Seok Oh

    This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class group is partitioned into two distinct subgroups at a node. The node adopts the class-modular scheme

  • Weight Status and Dental Problems in Early Childhood: Classification Tree Analysis of a National Cohort

    سند علمی۲۰۱۷Dentistry journalMichael Crowe, Michael O' Sullivan, Oscar Cassetti, Aifric O' Sullivan

    A poor quality diet may be a common risk factor for both obesity and dental problems such as caries. The aim of this paper is to use classification tree analysis (CTA) to identify predictors of dental problems in a nationally representative cohort of Irish pre-school children. CT

  • Fastest Distributed Consensus Averaging Problem on Perfect and Complete n-ary Tree networks

    سند علمی۲۰۱۰CoRRSaber Jafarizadeh

    Solving fastest distributed consensus averaging problem (i.e., finding weights on the edges to minimize the second-largest eigenvalue modulus of the weight matrix) over networks with different topologies is one of the primary areas of research in the field of sensor networks and

  • Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems

    سند علمی۲۰۱۴Social Choice and WelfareChristian Trudeau

    Minimum cost spanning tree problems connect agents e¢ ciently to a source when agents are located at di¤erent points and the cost of using an edge is xed. The folk and cycle-complete cost sharing solutions always o¤er core allocations. We provide similar characterizations for bot

  • CONVERGENCE PROBLEM SCHEMES FOR CONSTRUCTING STRUCTURES OF LOGICAL AND ALGORITHMIC CLASSIFICATION TREES

    مقاله‌ی دسترسی آزاد۲۰۲۲Ukraïns?kij žurnal ìnformacìjnih tehnologìj['Igor Povkhan', '']

    The problem of convergence the procedure for synthesizing classifier schemes in methods logical and algorithmic classification trees is considered. An upper estimate complexity algorithm tree scheme proposed approximating an array real data with a set generalized features fixed c

  • NP-Completeness of Some Tree-Clustering Problems

    سند علمی۱۹۹۸Graph DrawingFalk Schreiber, Konstantin Skodinis

    A graph is a tree of paths (cycles), if its vertex set can be partitioned into clusters, such that each cluster induces a simple path (cycle), and the clusters form a tree. Our main result states that the problem whether or not a given graph is a tree of paths (cycles) is NP-comp