scispace - formally typeset
Search or ask a question
Topic

Decision tree model

About: Decision tree model is a research topic. Over the lifetime, 2256 publications have been published within this topic receiving 38142 citations.


Papers
More filters
Proceedings ArticleDOI
01 Dec 2019
TL;DR: This paper presents optimal parameters for space colonization algorithm, several approaches to introduce variety in the generated tree models such as proceduralgeneration of unique crown shapes, several point sampling techniques and procedural generation of branch segments while maintaining the visual appeal and acceptable generation time.
Abstract: Realistic tree modeling has been a subject of several studies but their application remains a computationally expensive task for real-time tree model generation. Space colonization algorithm [1] is one of such method which utilizes competition of space between tree branches to generate visually realistic trees and bushes. In this paper, we study the applicability of space colonization algorithm for real-time procedural tree model generation for video games. We present optimal parameters for space colonization algorithm, several approaches to introduce variety in the generated tree models such as procedural generation of unique crown shapes, several point sampling techniques and procedural generation of branch segments while maintaining the visual appeal and acceptable generation time.

4 citations

01 Jan 2014
TL;DR: This work presents a framework for automatic Level-of-Detail control of botanical tree models based on hierarchical billboard clouds that is validated by comparing simplified versions of different trees with their full polygonal models.
Abstract: We present a framework for automatic Level-of-Detail control of botanical tree models based on hierarchical billboard clouds. These clouds react to quality measures developed specifically for plant models. They are optimized for providing minimum visual differences compared to the full polygonal models. The tree structure is analyzed to determine the geometric parts of the tree that are substituted by billboards. By computing the implicit surface of the tree model we can efficiently determine the average occlusion of each area within a tree that is used to guide the substitution. Our system is validated by comparing simplified versions of different trees with their full polygonal models. We realized our system as plug-in for MAXON CINEMA 4D.

4 citations

Proceedings ArticleDOI
06 Dec 2010
TL;DR: A control-flow complexity measure of the structured process of Web service composition based on a data structure named Structure Tree, which can get complexity of a process and its substructures simultaneously.
Abstract: The complexity of Web services composition process is intuitively relevant to the effects such as readability, testability, reliability, and maintainability. Analyzing the complexity at all stages of process design and development helps avoid the drawbacks associated with high-complexity processes. In this paper, we present a control-flow complexity measure of the structured process of Web service composition. The measure is defined based on a data structure named Structure Tree. By the complexity computing algorithm based on Structure Tree, we can get complexity of a process and its substructures simultaneously. The characteristics of different structure types and the nesting level are taken into consideration in the complexity measure. Since Weyuker’s properties are a widely known formal analytical approach of complexity metric, we evaluate our measure in terms of these properties in order to guarantee its effectiveness.

4 citations

Proceedings ArticleDOI
12 Jun 2012
TL;DR: This paper introduces the Hybrid Decision Tree with Harmony Search (HDT-HS) optimization algorithm to improve the rate of accuracy for the decision tree algorithm so as to apply it to DNA data sets.
Abstract: This paper introduces the Hybrid Decision Tree with Harmony Search (HDT-HS) optimization algorithm to improve the rate of accuracy for the decision tree algorithm so as to apply it to DNA data sets. The hybridization includes operating the decision tree method after the Improvisation step of the harmony search algorithm in order to navigate for several solutions at the same time. This is to improve the accuracy of the final results for the decision tree. The results show that the hybrid algorithm achieved better accuracy of about 96.73% compared to classifier algorithms such as Nave (94.8%), MBBC (95.99%); optimization algorithms such as bagging (94.5%) and boosting (94.7%); hybrid decision tree with genetic algorithm (70.7%) and another version from the decision tree such as C4.5 (94.3%) and PCL (94.4%).

4 citations

Patent
09 Jul 2014
TL;DR: In this article, a tree animation simulation method based on a simplification modal analytical method is proposed, where modal analysis is carried out on independent leaves and leaf stalks but not on a whole tree, then a dynamical model of the broad leaves is combined, and a new dynamic model of a tree is set up through matrix transformation according to the hierarchical structure of the tree.
Abstract: The invention relates to a tree animation simulation method based on a simplification modal analytical method. According to the simulation method, modal analysis is carried out on independent leaves and leaf stalks but not on a whole tree, then a dynamical model of the broad leaves is combined, and a new dynamical model of the tree is set up through matrix transformation according to the hierarchical structure of the tree. The method comprises the specific steps: a dynamical model of a three-dimensional bending cantilever beam is set up, dynamical equations of the bending beam are respectively expressed as a time domain equation and a space domain equation by adopting a variable separation method, an air dynamical model is set up to determine the sum of the external force applied on branches, the dynamical model of the leaves is set up to solve the sum of the external force applied on blades, and a tree model and the dynamical model of the whole tree are set up. The tree animation simulation method can be used for developing three-dimensional tree animation simulation engines, serves as a support for development of virtual reality, game and three-dimensional animation core technologies, and has the important application prospect.

4 citations


Network Information
Related Topics (5)
Cluster analysis
146.5K papers, 2.9M citations
80% related
Artificial neural network
207K papers, 4.5M citations
78% related
Fuzzy logic
151.2K papers, 2.3M citations
77% related
The Internet
213.2K papers, 3.8M citations
77% related
Deep learning
79.8K papers, 2.1M citations
77% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202310
202224
2021101
2020163
2019158
2018121