IMPLEMENTING TREE BUILDING INTO LARGE HISTORICAL GEOLOGY FLIPPED CLASSES

2016 ◽  
Author(s):  
Win N.F. McLaughlin ◽  
◽  
Eva Marie Biedron ◽  
Edward Byrd Davis ◽  
Samantha S.B. Hopkins
2011 ◽  
Vol 1 (7) ◽  
pp. 83-85
Author(s):  
Jasmine Jasmine ◽  
◽  
Pankaj Bhambri ◽  
Dr. O.P. Gupta Dr. O.P. Gupta

2019 ◽  
Author(s):  
Jenna L. Faith ◽  
◽  
Leslie Bernal ◽  
Jose Pablo Cervantes ◽  
Diane I. Doser
Keyword(s):  

Author(s):  
Ferdinand Bollwein ◽  
Stephan Westphal

AbstractUnivariate decision tree induction methods for multiclass classification problems such as CART, C4.5 and ID3 continue to be very popular in the context of machine learning due to their major benefit of being easy to interpret. However, as these trees only consider a single attribute per node, they often get quite large which lowers their explanatory value. Oblique decision tree building algorithms, which divide the feature space by multidimensional hyperplanes, often produce much smaller trees but the individual splits are hard to interpret. Moreover, the effort of finding optimal oblique splits is very high such that heuristics have to be applied to determine local optimal solutions. In this work, we introduce an effective branch and bound procedure to determine global optimal bivariate oblique splits for concave impurity measures. Decision trees based on these bivariate oblique splits remain fairly interpretable due to the restriction to two attributes per split. The resulting trees are significantly smaller and more accurate than their univariate counterparts due to their ability of adapting better to the underlying data and capturing interactions of attribute pairs. Moreover, our evaluation shows that our algorithm even outperforms algorithms based on heuristically obtained multivariate oblique splits despite the fact that we are focusing on two attributes only.


2015 ◽  
Vol 28 (1) ◽  
pp. 46 ◽  
Author(s):  
David A. Morrison ◽  
Matthew J. Morgan ◽  
Scot A. Kelchner

Sequence alignment is just as much a part of phylogenetics as is tree building, although it is often viewed solely as a necessary tool to construct trees. However, alignment for the purpose of phylogenetic inference is primarily about homology, as it is the procedure that expresses homology relationships among the characters, rather than the historical relationships of the taxa. Molecular homology is rather vaguely defined and understood, despite its importance in the molecular age. Indeed, homology has rarely been evaluated with respect to nucleotide sequence alignments, in spite of the fact that nucleotides are the only data that directly represent genotype. All other molecular data represent phenotype, just as do morphology and anatomy. Thus, efforts to improve sequence alignment for phylogenetic purposes should involve a more refined use of the homology concept at a molecular level. To this end, we present examples of molecular-data levels at which homology might be considered, and arrange them in a hierarchy. The concept that we propose has many levels, which link directly to the developmental and morphological components of homology. Of note, there is no simple relationship between gene homology and nucleotide homology. We also propose terminology with which to better describe and discuss molecular homology at these levels. Our over-arching conceptual framework is then used to shed light on the multitude of automated procedures that have been created for multiple-sequence alignment. Sequence alignment needs to be based on aligning homologous nucleotides, without necessary reference to homology at any other level of the hierarchy. In particular, inference of nucleotide homology involves deriving a plausible scenario for molecular change among the set of sequences. Our clarifications should allow the development of a procedure that specifically addresses homology, which is required when performing alignment for phylogenetic purposes, but which does not yet exist.


1961 ◽  
Vol 127 (4) ◽  
pp. 536
Author(s):  
F. Dixey ◽  
Bernhard Kummel

Author(s):  
Rhys J. J. Poulton ◽  
Aaron S. G. Robotham ◽  
Chris Power ◽  
Pascal J. Elahi

AbstractMerger trees harvested from cosmologicalN-body simulations encode the assembly histories of dark matter halos over cosmic time and are a fundamental component of semi-analytical models of galaxy formation. The ability to compare the tools used to construct merger trees, namely halo finders and tree building algorithms, in an unbiased and systematic manner is critical to assess the quality of merger trees. In this paper, we present the dendrogram, a novel method to visualise merger trees, which provides a comprehensive characterisation of a halo’s assembly history—tracking subhalo orbits, halo merger events, and the general evolution of halo properties. We show the usefulness of thedendrogramas a diagnostic tool of merger trees by comparing halo assembly simulation analysed with three different halo finders—VELOCIraptor, AHF, and Rockstar—and their associated tree builders. Based on our analysis of the resulting dendrograms, we highlight how they have been used to motivate improvements to VELOCIraptor. Thedendrogramsoftware is publicly available online, at:https://github.com/rhyspoulton/MergerTree-Dendrograms.


Sign in / Sign up

Export Citation Format

Share Document