Log in

Relevant bibliographies by topics / Partition tree

Contents

Journal articles

Academic literature on the topic 'Partition tree'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Partition tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Partition tree"

1

Mu, Yashuang, Lidong Wang, and Xiaodong Liu. "Dynamic programming based fuzzy partition in fuzzy decision tree induction." Journal of Intelligent & Fuzzy Systems 39, no. 5 (2020): 6757–72. http://dx.doi.org/10.3233/jifs-191497.

Full text

Abstract:

Fuzzy decision trees are one of the most popular extensions of decision trees for symbolic knowledge acquisition by fuzzy representation. Among the majority of fuzzy decision trees learning methods, the number of fuzzy partitions is given in advance, that is, there are the same amount of fuzzy items utilized in each condition attribute. In this study, a dynamic programming-based partition criterion for fuzzy items is designed in the framework of fuzzy decision tree induction. The proposed criterion applies an improved dynamic programming algorithm used in scheduling problems to establish an op

APA, Harvard, Vancouver, ISO, and other styles

2

ARKIN, ESTHER M., DELIA GARIJO, ALBERTO MÁRQUEZ, JOSEPH S. B. MITCHELL, and CARLOS SEARA. "SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES." International Journal of Computational Geometry & Applications 22, no. 02 (2012): 143–65. http://dx.doi.org/10.1142/s0218195912500021.

Full text

Abstract:

Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level binary space partition (BSP) tree to classify/separate R and B, such that the tree defines a linear decision at each internal node and each leaf of the tree corresponds to a (convex) cell of the partition that contains only red or only blue points. Specifically, we show that a 2-level tree can be computed, if one exists, in time O(n2). We show that a minimum-level (3 ≤ k ≤ log n) tree can be computed in time nO( log n). In the special case of axis-parallel partitions, we sho

APA, Harvard, Vancouver, ISO, and other styles

3

Wood, David R. "On tree-partition-width." European Journal of Combinatorics 30, no. 5 (2009): 1245–53. http://dx.doi.org/10.1016/j.ejc.2008.11.010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Proe, M. F., and P. Millard. "Effect of N supply upon the seasonal partitioning of N and P uptake in young Sitka spruce (Piceasitchensis)." Canadian Journal of Forest Research 25, no. 10 (1995): 1704–9. http://dx.doi.org/10.1139/x95-184.

Full text

Abstract:

Seasonal relationships between N supply, tree growth, and partitioning of both N and P have been studied in young trees using 15N and 32P isotopes. Three-year-old clonal cuttings of Sitka spruce (Piceasitchensis (Bong.) Carr.) were grown for 2 years in sand irrigated with a nutrient solution containing either 1.0 mol N•m−3 (low N) or 6.0 mol N•m−3 (high N). In the first year, trees received 2-week pulses of 15N and 32P to label current nutrient uptake during either a period of rapid spring growth or shortly after bud set in summer. In the second year, trees that had been preconditioned to a lo

APA, Harvard, Vancouver, ISO, and other styles

5

Katrenič, Peter, and Gabriel Semanišin. "On a tree-partition problem." Electronic Notes in Discrete Mathematics 28 (March 2007): 325–30. http://dx.doi.org/10.1016/j.endm.2007.01.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

HURTADO, FERRAN, GIUSEPPE LIOTTA, and DAVID R. WOOD. "PROXIMITY DRAWINGS OF HIGH-DEGREE TREES." International Journal of Computational Geometry & Applications 23, no. 03 (2013): 213–30. http://dx.doi.org/10.1142/s0218195913500088.

Full text

Abstract:

A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree? We approach this question by supposing that a partition or covering of the tree by subtrees of bounded degree is given. Then we show that if the partition or covering satisfies some natural properties, then there is a drawing of the entire tree such that each of the given subtrees is drawn as a minimum spanning tree of its vertex set.

APA, Harvard, Vancouver, ISO, and other styles

7

Gao, Jing. "Decision Tree Generation Algorithm without Pruning." Applied Mechanics and Materials 441 (December 2013): 731–37. http://dx.doi.org/10.4028/www.scientific.net/amm.441.731.

Full text

Abstract:

On the generation of decision tree based on rough set model, for the sake of classification accuracy, existing algorithms usually partition examples too specific. And it is hard to avoid the negative impact caused by few special examples on decision tree. In order to obtain this priority in traditional decision tree algorithm based on rough set, the sample is partitioned much more meticulously. Inevitably, a few exceptional samples have negative effect on decision tree. And this leads that the generated decision tree seems too large to be understood. It also reduces the ability in classifying

APA, Harvard, Vancouver, ISO, and other styles

8

Shan, Gui Jun. "Partition Real Data in Decision Tree Using Statistical Criterion." Applied Mechanics and Materials 380-384 (August 2013): 1469–72. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1469.

Full text

Abstract:

Partition methods for real data play an extremely important role in decision tree algorithms in data mining and machine learning because the decision tree algorithms require that the values of attributes are discrete. In this paper, we propose a novel partition method for real data in decision tree using statistical criterion. This method constructs a statistical criterion to find accurate merging intervals. In addition, we present a heuristic partition algorithm to achieve a desired partition result with the aim to improve the performance of decision tree algorithms. Empirical experiments on

APA, Harvard, Vancouver, ISO, and other styles

9

Guttmann-Beck, Nili, and Refael Hassin. "Approximation algorithms for minimum tree partition." Discrete Applied Mathematics 87, no. 1-3 (1998): 117–37. http://dx.doi.org/10.1016/s0166-218x(98)00052-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Tang, Jing, Yinghui Wang, Ningna Wang, et al. "Swaying Tree Simulation by Slicing Partition." Chinese Journal of Electronics 29, no. 5 (2020): 826–32. http://dx.doi.org/10.1049/cje.2020.07.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!