The Algorithmic Classification Trees

Povkhan, Igor; Lupei, Maksym

doi:10.1109/dsmp47368.2020.9204198

Cited by 2 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Study [9] proposes a scheme of generating the LCT structure based on a stepwise selection of elementary attributes, the disadvantage of which is the heavy dependence of model complexity on the effectiveness of the final minimization, the procedure of tree pruning. Papers [10,11] suggest a modular scheme to build classifiers in the form of classification tree structures, which makes it possible to circumvent the limitations of conventional decision tree methods. Work [12] proposes an effective scheme for generating generalized features based on constructing the sets of hyperparallelepipeds.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

“…The ability of LCT/ACT structures (logical and algorithmic classification trees) to perform one-dimensional branching to analyze the impact, importance, quality of individual variables makes it possible to treat variables of different types in the form of predicates. For the case of ACT models, the issue of assessing the quality of relevant branching structures, autonomous classification algorithms, remains relevant [11]. To improve the methods of ACT structures, there is a search for effective criteria for branching the structure of trees.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

“…The concept of classification trees makes it possible to use the combination of attributes and their sets as the signs, the vertices of a classification tree structure. If one dives deeper and disregards the attributes of objects as branching while selecting individual independent recognition algorithms, evaluated according to TS, a new structure of the ACT would be obtained at the output [10,11]. Thus, there is a fundamental need to construct an effective method based on the concept of decision trees for recognizing large data sets while rationally utilizing the already accumulated potential of methods and classification schemes.…”

Section: Literature Review and Problem Statementmentioning

confidence: 99%

See 2 more Smart Citations

Classification models of flood-related events based on algorithm trees

Povkhan

2020

EEJET

Self Cite

View full text Add to dashboard Cite

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Section: Literature Review and Problem Statementmentioning

confidence: 99%

Section: Literature Review and Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

Classification models of flood-related events based on algorithm trees

Povkhan

2020

EEJET

Self Cite

View full text Add to dashboard Cite

Convergence Problem Schemes for Constructing Structures of Logical and Algorithmic Classification Trees

Povkhan¹

2022

UJIT

View full text Add to dashboard Cite

The problem of convergence of the procedure for synthesizing classifier schemes in the methods of logical and algorithmic classification trees is considered. An upper estimate of the complexity of the algorithm tree scheme is proposed in the problem of approximating an array of real data with a set of generalized features with a fixed criterion for stopping the branching procedure at the stage of constructing a classification tree. This approach allows you to ensure the necessary accuracy of the model, assess its complexity, reduce the number of branches and achieve the necessary performance indicators. For the first time, methods for constructing structures of logical and algorithmic classification trees are given an upper estimate of the convergence of constructing classification trees. The proposed convergence estimate of the procedure for constructing classifiers for LCT/ACT structures makes it possible to build economical and efficient classification models of a given accuracy. The method of constructing an algorithmic classification tree is based on a step-by-step approximation of an initial sample of arbitrary volume and structure by a set of independent classification algorithms. When forming the current vertex of an algorithmic tree, node, or generalized feature, this method highlights the most efficient, high-quality autonomous classification algorithms from the initial set. This approach to constructing the resulting classification tree can significantly reduce the size and complexity of the tree, the total number of branches, vertices, and tiers of the structure, improve the quality of its subsequent analysis, interpretability, and ability to decompose. Methods for synthesizing logical and algorithmic classification trees were implemented in the library of algorithms of the “Orion III” software system for solving various applied problems of artificial intelligence. Practical applications have confirmed the operability of the constructed classification tree models and the developed software. The paper estimates the convergence of the procedure for constructing recognition schemes for cases of logical and algorithmic classification trees under conditions of weak and strong class separation of the initial sample. Prospects for further research and testing may consist in evaluating the convergence of the ACT synthesis procedure in a limited method of the algorithmic classification tree, which consists in maintaining a criterion for stopping the procedure for constructing a tree model by the depth of the structure, optimizing its software implementations, introducing new types of algorithmic trees, as well as experimental studies of this method for a wider range of practical problems.

show abstract

The Algorithmic Classification Trees

Cited by 2 publications

References 20 publications

Classification models of flood-related events based on algorithm trees

Classification models of flood-related events based on algorithm trees

Convergence Problem Schemes for Constructing Structures of Logical and Algorithmic Classification Trees

Contact Info

Product

Resources

About