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 published on a yearly basis
Papers
More filters
••
08 Oct 2007TL;DR: This paper explores the problem of minimum energy reliable information gathering (MERIG) in wireless sensor networks under data fusion tree model from the perspective of information value and proposes the optimal algorithm and the distributed approximate algorithm.
Abstract: Data fusion is widely used in wireless sensor networks. In this paper, we explore the problem of minimum energy reliable information gathering (MERIG) in wireless sensor networks under data fusion tree model. From the perspective of information value, two algorithms, the optimal algorithm and the distributed approximate algorithm are proposed. The optimal algorithm is the optimal solution for MERIG while the distributed algorithm can approximate the optimal well. Using these two schemes, the information reliability can be guaranteed with high energy efficient manner under unreliable wireless environment.
01 Jan 2012
TL;DR: In this paper, an improved breeder genetic programming algorithm is proposed to the synthesis of neural tree model and the effectiveness and per-formance of the method are evaluated on time series pre- diction problems and compared with those of related methods.
Abstract: Neural tree model has been successfully applied to solving a variety of interesting problems. In most previous studies, optimization of the neural tree model was divided into two steps: first structure optimi- zation, then parameter optimization. One major problem in the evolution of structure without parameter information was noisy fitness evaluation. In this paper, an improved breeder genetic programming algorithm is proposed to the synthesis of neural tree model. The effectiveness and per- formance of the method are evaluated on time series pre- diction problems and compared with those of related methods. Simulation results show that the proposed algo- rithm is a potential method with better performance and effectiveness.
••
15 Oct 2003TL;DR: A graph based sorting algorithm, designated as ARKEPIanGraphSort that takes time /spl otimes/(n/sup 2/) in the worst-case, where n is the number of records in the given list to be sorted.
Abstract: Sorting is a well-known problem frequently used in many aspects of the world of computational application. Sorting means arranging a set of records (or a list of keys) in some (increasing or decreasing) order. In this paper, we propose a graph based sorting algorithm, designated as ARKEPIanGraphSort that takes time /spl otimes/(n/sup 2/) in the worst-case, where n is the number of records in the given list to be sorted.
••
•
02 Mar 2016
TL;DR: In this article, a link information management method based on tree model construction is proposed, which comprises the following steps of: S1, constructing link object trees in real time according to link information of maintenance links; S2, using a set of the plurality of link objects as a forest, and setting index information for each link object tree in the forest; and S3, after a fault in the maintenance process is discovered, converting the fault into a screening condition, carrying out querying in a forest according to the screening condition and the set index information, and displaying the information
Abstract: The invention discloses a link information management method based on tree model construction. The method comprises the following steps of: S1, constructing link object trees in real time according to link information of maintenance links; S2, using a set of the plurality of link object trees as a forest, and setting index information for each link object tree in the forest; and S3, after a fault in the maintenance process is discovered, converting the fault into a screening condition, carrying out querying in the forest according to the screening condition and the set index information, and displaying the information of a broken-down link. By adopting the method, the link information in the maintenance process can be effectively managed, and the safety of maintenance information is further improved.