Abstract
We applied the alternating decision trees (ADTrees) method to the last 3 replicates from the Aipotu, Danacca, Karangar, and NYC populations in the Problem 2 simulated Genetic Analysis Workshop dataset. Using information from the 12 binary phenotypes and sex as input and Kofendrerd Personality Disorder disease status as the outcome of ADTrees-based classifiers, we obtained a new quantitative trait based on average prediction scores, which was then used for genome-wide quantitative trait linkage (QTL) analysis. ADTrees are machine learning methods that combine boosting and decision trees algorithms to generate smaller and easier-to-interpret classification rules. In this application, we compared four modeling strategies from the combinations of two boosting iterations (log or exponential loss functions) coupled with two choices of tree generation types (a full alternating decision tree or a classic boosting decision tree). These four different strategies were applied to the founders in each population to construct four classifiers, which were then applied to each study participant. To compute average prediction score for each subject with a specific trait profile, such a process was repeated with 10 runs of 10-fold cross validation, and standardized prediction scores obtained from the 10 runs were averaged and used in subsequent expectation-maximization Haseman-Elston QTL analyses (implemented in GENEHUNTER) with the approximate 900 SNPs in Hardy-Weinberg equilibrium provided for each population. Our QTL analyses on the basis of four models (a full alternating decision tree and a classic boosting decision tree paired with either log or exponential loss function) detected evidence for linkage (Z ≥ 1.96, p < 0.01) on chromosomes 1, 3, 5, and 9. Moreover, using average iteration and abundance scores for the 12 phenotypes and sex as their relevancy measurements, we found all relevant phenotypes for all four populations except phenotype b for the Karangar population, with suggested subgroup structure consistent with latent traits used in the model. In conclusion, our findings suggest that the ADTrees method may offer a more accurate representation of the disease status that allows for better detection of linkage evidence.
Highlights
Alternating decision trees (ADTrees) are machine learning methods combining boosting and decision trees algorithms to generate classification rules [1]
Using average iteration and abundance scores for the 12 phenotypes and sex as their relevancy measurements, we found all relevant phenotypes for all four populations except phenotype b for the Karangar population, with suggested subgroup structure consistent with latent traits used in the model
The log loss function appeared to perform slightly better than the exponential loss function except in the Karangar population, the two loss functions only differed by one step
Summary
Alternating decision trees (ADTrees) are machine learning methods combining boosting and decision trees algorithms to generate classification rules [1]. Traditional boosting decision tree algorithms such as CART [2] and C4.5 [3] have been successful in generating classifiers but at the cost of creating complicated decision-tree structures. Such structures often represent convoluted decision (page number not for citation purposes). F 0 x { 0, for t 1 T : wyFxt exp i i t 1 i. D h get from weak learner, t t ¦ w§ lnh x y i: i t i· ¦ w© h x y i: i i1 FFDht 1
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have