Applications, Basics, and Computing of Exploratory Data Analysis (ABC of EDA)

Front Cover
Copyright and Permissible Usage
Dedication
Contents
Preface
Introduction
Chapter 1 Stem-and-Leaf Displays
	1.1 Stems and Leaves
	1.2 Multiple Lines per Stem
	1.3 Positive and Negative Values
	1.4 Listing Apparent Strays
	1.5 Histograms
	1.6 Stem-and-Leaf Displays from the Computer
	1.7 Algorithms I
	1.8 Algorithms II
	References
Chapter 2: Letter-Value Displays
	2.1 Median, Hinges, and other Summary Values
	2.2 Letter Values
	2.3 Displaying the Letter Values
	2.4 Re-expression and the Ladder of Powers
	2.5 Re-expression for Symmetry: An Example
	2.6 Comparing Spreads to the Gaussian Distribution∫
	2,7 Letter Values from the Computer
	2.8 Algorithms
	2.9 Sorting
	References
Chapter 3: Boxplots
	3.1 Basic Purposes
	3.2 The Skeletal Boxplot
	3.3 Outliers
	3.4 Making a Boxplot
	3.5 Boxplots from the Computer
	3.6 Computing Batches
	3.7 More Refined Comparisons: Notched Boxplots
	3.8 Using the Programs
	3.9 Algotithms
	3.10 Further Refinements in Display
	3.11 Further Refinements in Display
	3.12 Details of the Notched Boxplot
	References
Chapter 4: x - y Plotting
	4.1 x-y Plots
	4.2 Computer Plots
	4.3 Condensed Plots
	4.4 Coded Plot Symbols
	4.5 Condensed Plots and Stem-and-Leaf Displays
	4.6 Bounds for Plots
	4.7 Focusing Plots
	4.8 Using the Programs
	4.9 Algorithms
	4.10 Alternatives
	4.11 Details of the Programs
	References
Chapter 5: Resistant Line
	5.1 Slope and Intercept
	5.2 Summary Points
	5.3 Finding the Slope and the Intercept
	5.4 Residuals
	5.5 Polishing the Fit
	5.6 Example: Breast Cancer Mortality versus Temperature
	5.7 Outliers
	5.8 Straightening Plots bt Re-expression
	5.9 Interpreting Fits to Re-expressed x-y Data
	5.10 Resistant Lines and Least-Squares Regression
	5.11 Resistant Lines from the Computer
	5.12 Algorithms
	References
Chapter 6: Smoothing Data
	6.1 Data Sequences and Smooth Summaries
	6.2 Elementary Smoothers
	6.3 Compound Smoothers
	6.4 Smoothing the Endpoints
	6.5 Splitting and 3RSSH
	6.6 Looking at the Rough
	6.7 Smoothing and the Computer
	6.8 Algorithms
	References
Chapter 7: Coded Tables
	7.1 Displaying Tables
	7.2 Coded Tables from the Computer
	7.3 Coded Tables and Boxplots
	7.4 Algorithms
	7.5 Details and Alternatives
	References
Chapter 8: Median Polish
	8.1 Two-Way Tables
	8.2 A Model for Two-Way Tables
	8.3 Residuals
	8.4 Fitting an Additive Model by Median Polish
	8.5 Re-expressing for Additivity
	8.6 Median Polish from the Computer
	8.7 Median Polish and ANOVA
	8.8 Data Structure
	8.9 Algorithms
	References
Chapter 9: Rootograms
	9.1 Hostograms and the Area Principle
	9.2 Comparisons and Residuals
	9.3 Rootograms
	9.4 Fitting a Gaussian Comparison Curve
	9.5 Suspended Rootograms
	9.6 Rootograms from the Computer
	9.7 More on Double Roots
	References
Appendix A: Computer Graphics
	A.1 Terminology
	A.2 Exploratory Displays
	A.3 Resistant Scaling
	A.4 Printer Plots
	A.5 Display Details
Appendix B: Utility Programs
	B.1 BASIC
	B.2 FORTRAN
Appendix C: Programming Conventions
	C.1 BASIC
	C.2 FORTRAN
	References
Appendix D: Minitab Implementation
	References
	D.1 Stem-and-Leaf Displays
	D.2 Letter0Value Displays
	D.3 Boxplots
	D.4 Condensed Plotting
	D.5 Resistant Lines
	D.6 Resistanr Smoothing
	D.7 Coded Tables
	D.8 Median Polish
	D.9 Suspended Rootograms
Index