Problems in the Analysis of Survey Data, and a Proposal
By J. Morgan, J. Sonquist. 1963
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Susan Athey
- Wei-Yin Loh
- Achim Zeileis
- Torsten Hothorn
- Stefan Wager
- Thomas Rusch
- Kurt Hornik
- Cynthia Rudin
Citations in the corpus
- Interpretable Machine Learning: Fundamental Principles and 10 Grand Challenges (2021, background): “Since Morgan and Sonquist (1963) developed the first decision tree algorithm, many works have been proposed to build decision trees and improve their performance.”
- REGRESSION TREES WITH UNBIASED VARIABLE SELECTION AND INTERACTION DETECTION (2002, methodology): “The AID algorithm (Morgan and Sonquist (1963), Fielding (1977)) is the first implementation of this idea.”
- Comparison of nearest neighbour approaches for small area estimation of tree species-specific forest inventory attributes in central Europe using airborne laser scanner data (2010, methodology): “A decision tree is a regression model that explains variation in the response variables by recursively partitioning the data set (Morgan and Sonquist 1963).”
- Reinforcement Learning Trees (1996, unknown): “These estimation procedures resembles to the use of regression and neural trees [6, 8].”
- Discrepancy Analysis of State Sequences (2011, background): “Regression trees work as follows (Morgan and Sonquist 1963; Breiman, Friedman, Olshen, and Stone 1984).”
- Classification tree analysis using TARGET (2008, methodology): “The earliest decision tree models were automatic interaction detection (AID) proposed by Morgan and Sonquest (1963) and chi-square automatic interaction detection (CHAID) proposed by Kass (1980).”
- QUBIC: a qualitative biclustering algorithm for analyses of gene expression data (2009, background): “Partitioning a matrix into submatrices with approximately the same values was first studied by Morgan and Sonquist (5) and Hartigan (6).”
- Variable selection and sensitivity analysis using dynamic trees, with an application to computer code performance tuning (2011, unknown): “Indeed, this idea motivated some of the earliest work on the use of trees, as presented by Morgan and Sonquist (1963), for automatic interaction detection.”