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.

Improved ID3 algorithm based on attribute values

Abstract: ID3 is a classical decision tree induction algorithm in data mining.It has the preference bias in selecting attributes with multiple values and is related to the number of training examples.A new approach to solving these drawbacks is given.At first,the threshold of attributes value's number is assigned to optimize the decision tree in calculating the entropy.At the meantime,a tree pruning method is implemented by adopting another threshold to reduce the error rate of the fully expanded tree.Experimental results demonstrated that the improved ID3 algorithm(AVID3) is more efficient than the traditional ID3 algorithm on many data sets.

Real-time information recombination of complex 3D tree model based on visual perception

Abstract: It is important for the rapid visualization of large scale forest scene to dynamically simplify and recombine model data. In order to preserve the geometric features and visual perception of tree model, this paper presents a real-time information recombination method of complex 3D tree model based on visual perception. This method adopts visual attention model and the visual characteristic of tree structures, and then uses geometry-based and image-based methods to simplify tree models and construct a hybrid representation model. The hybrid representation model reflects the visual perception features of 3D tree models that can embody topological semantics in dynamic simulation. In addition, this method automatically extracts the representation information of 3D tree model based on visual perception, and recombines model information in real time according to the dynamic viewpoint of virtual scene. Finally, this method is applied in the simplification of different tree models, and it is compared with the existing tree model simplification methods. Experimental results show that this method can not only preserve better visual perception for 3D tree models, but also effectively decrease the geometric data of forest scene, and improve the rendering efficiency of forest scene.

Estimating Missing Values in a Tree Distance

Abstract: In phylogeny, one tries to approximate a given dissimilarity by a tree distance. In some cases, especially when comparing biological sequences, some dissimilarity values cannot be evaluated and a partial dissimilarity with undefined values is only available. In that case one can develop a sequential method to reconstruct a weighted tree or to evaluate the missing values using a tree model. In this paper we study the latter approach and measure the quality of the estimated values using simulated noisy tree distances.

The reconstruction of three-dimensional tree models from terrestrial LiDAR

Abstract: This paper presents a way to reconstruct three-dimensional tree models based on point clouds from terrestrial LiDAR (TLiDAR). To input data of fixed format into AutoCAD and 3DMAX to reconstruct models through LiDAR scanning software, with an advantage of that, we can use general software to reconstruct tree model from point clouds; the model is accurate and relatively insensitive to occlusion-induced artifacts with less interference, and any part of the volume size could be taken. The result of the method confirms the appropriateness of the proposed tree reconstruction model for the generation of structurally of existing plant, be able to meet the requirements of 3D green biomass and biomass calculations.

Researching the Complexity of Boolean Functions with Computers

Abstract: With the rapid advances in computers, it becomes attractive to explore the use of computers to attack open problems in computational complexity. In this article, we concentrate on the problems of the complexity of Boolean functions, and overview several recent attempts to use computers in various ways to obtain concrete results on major problems in computational complexity. We discuss the problems on several computational models including ordered binary decision diagrams, Boolean circuits, and polynomial threshold representations of Boolean functions.