Information Technology | Databases » Trevor Hastie - Statistical Learning with Big Data

Source: http://www.doksinet Statistical Learning with Big Data Trevor Hastie Department of Statistics Department of Biomedical Data Science Stanford University Thanks to Rob Tibshirani for some slides 1 / 39 Source: http://www.doksinet Some Take Home Messages This talk is about supervised learning: building models from data that predict an outcome using a collection of input features. • There are some powerful and exciting tools for making predictions from data. • They are not magic! You should be skeptical. They require good data and proper internal validation. • Human judgement and ingenuity are essential for their success. • With big data - model fitting takes longer. This might test our patience for model evaluation and comparison. - difficult to look at the data; might be contaminated in parts. Careful subsampling can help with both of these. 2 / 39 Source: http://www.doksinet Some Definitions Machine Learning constructs algorithms that can learn from data.

Statistical Learning is a branch of applied statistics that emerged in response to machine learning, emphasizing statistical models and assessment of uncertainty. Data Science is the extraction of knowledge from data, using ideas from mathematics, statistics, machine learning, computer science, engineering, . All of these are very similar with different emphases. 3 / 39 Source: http://www.doksinet Some Definitions Machine Learning constructs algorithms that can learn from data. Statistical Learning is a branch of applied statistics that emerged in response to machine learning, emphasizing statistical models and assessment of uncertainty. Data Science is the extraction of knowledge from data, using ideas from mathematics, statistics, machine learning, computer science, engineering, . All of these are very similar with different emphases. Applied Statistics? 3 / 39 Source: http://www.doksinet For Statisticians: 15 minutes of fame 2009 “I keep saying the sexy job in the next

ten years will be statisticians. And I’m not kidding!” Hal Varian, Chief Economist Google 2012 “Data Scientist: The sexiest job of the 21st century.” Harvard Business Review 4 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet Sexiest man alive? 5 / 39 Source: http://www.doksinet The Supervising Learning Paradigm Training Data Fitting Prediction Traditional statistics: domain experts work for 10 years to learn good

features; they bring the statistician a small clean dataset Today’s approach: we start with a large dataset with many features, and use a machine learning algorithm to find the good ones. A huge change 6 / 39 Source: http://www.doksinet Internal Model Validation • IMPORTANT! Don’t trust me or anyone who says they have a wonderful machine learning algorithm, unless you see the results of a careful internal validation. • Eg: divide data into two parts A and B. Run algorithm on part A and then test it on part B. Algorithm must not have seen any of the data in part B. • If it works in part B, you have (some) confidence in it 7 / 39 Source: http://www.doksinet Internal Model Validation • IMPORTANT! Don’t trust me or anyone who says they have a wonderful machine learning algorithm, unless you see the results of a careful internal validation. • Eg: divide data into two parts A and B. Run algorithm on part A and then test it on part B. Algorithm must not have seen

any of the data in part B. • If it works in part B, you have (some) confidence in it Simple? Yes 7 / 39 Source: http://www.doksinet Internal Model Validation • IMPORTANT! Don’t trust me or anyone who says they have a wonderful machine learning algorithm, unless you see the results of a careful internal validation. • Eg: divide data into two parts A and B. Run algorithm on part A and then test it on part B. Algorithm must not have seen any of the data in part B. • If it works in part B, you have (some) confidence in it Simple? Yes Done properly in practice? Rarely 7 / 39 Source: http://www.doksinet Internal Model Validation • IMPORTANT! Don’t trust me or anyone who says they have a wonderful machine learning algorithm, unless you see the results of a careful internal validation. • Eg: divide data into two parts A and B. Run algorithm on part A and then test it on part B. Algorithm must not have seen any of the data in part B. • If it works in part B, you

have (some) confidence in it Simple? Yes Done properly in practice? Rarely In God we trust. All others bring data 7 / 39 Source: http://www.doksinet Big data vary in shape. These call for different approaches Wide Data Thousands / Millions of Variables Hundreds of Samples Screening and fdr, Lasso, SVM, Stepwise Tall Data We have too many variables; prone to overfitting. Need to remove variables, or regularize, or both. Tens / Hundreds of Variables Thousands / Millions of Samples GLM, Random Forests, Boosting, Deep Learning Sometimes simple models (linear) don’t suffice. We have enough samples to fit nonlinear models with many interactions, and not too many variables. Good automatic methods for doing this. 8 / 39 Source: http://www.doksinet Big data vary in shape. These call for different approaches Tall and Wide Data Thousands / Millions of Variables Millions to Billions of Samples Tricks of the Trade Exploit sparsity Random projections / hashing Variable screening

Subsample rows Divide and recombine Case/ control sampling MapReduce ADMM (divide and conquer) . . . 9 / 39 Source: http://www.doksinet Big data vary in shape. These call for different approaches Tall and Wide Data Thousands / Millions of Variables Millions to Billions of Samples Tricks of the Trade Exploit sparsity Random projections / hashing Variable screening Subsample rows Divide and recombine Case/ control sampling MapReduce ADMM (divide and conquer) . . . join Google 10 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems 11 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems Click-through rate. Based on the search term, knowledge of this user (IPAddress), and the Webpage about to be served, what is the probability that each of the 30 candidate ads in an ad campaign would be clicked if placed in the right-hand panel. 11 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems Click-through rate. Based on

the search term, knowledge of this user (IPAddress), and the Webpage about to be served, what is the probability that each of the 30 candidate ads in an ad campaign would be clicked if placed in the right-hand panel. Logistic regression with billions of training observations. Each ad exchange does this, then bids on their top candidates, and if they win, serve the ad all within 10ms! 11 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems 12 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems Recommender systems. Amazon online store, online DVD rentals, Kindle books, . 12 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems Recommender systems. Amazon online store, online DVD rentals, Kindle books, . Based on my past experiences, and those of others like me, what else would I chose? 12 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems • Adverse drug interactions. US FDA (Food and Drug

Administration) requires physicians to send in adverse drug reports, along with other patient information, including disease status and outcomes. Massive and messy data 13 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems • Adverse drug interactions. US FDA (Food and Drug Administration) requires physicians to send in adverse drug reports, along with other patient information, including disease status and outcomes. Massive and messy data Using natural language processing, Stanford BMI researchers (Altman lab) found drug interactions associated with good and bad outcomes. 13 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems • Adverse drug interactions. US FDA (Food and Drug Administration) requires physicians to send in adverse drug reports, along with other patient information, including disease status and outcomes. Massive and messy data Using natural language processing, Stanford BMI researchers (Altman lab) found drug

interactions associated with good and bad outcomes. • Social networks. Based on who my friends are on Facebook or LinkedIn, make recommendations for who else I should invite. Predict which ads to show me 13 / 39 Source: http://www.doksinet Examples of Big Data Learning Problems • Adverse drug interactions. US FDA (Food and Drug Administration) requires physicians to send in adverse drug reports, along with other patient information, including disease status and outcomes. Massive and messy data Using natural language processing, Stanford BMI researchers (Altman lab) found drug interactions associated with good and bad outcomes. • Social networks. Based on who my friends are on Facebook or LinkedIn, make recommendations for who else I should invite. Predict which ads to show me There are more than a billion Facebook members, and two orders of magnitude more connections. Knowledge about friends informs our knowledge about you. Graph modeling is a hot area of research. (eg

Leskovec lab, Stanford CS) 13 / 39 Source: http://www.doksinet The Netflix Recommender 14 / 39 Source: http://www.doksinet The Netflix Prize 2006–2009 41K teams participated! Competition ran for nearly 3 years. Winner “BellKor’s Pragmatic Chaos”, essentially tied with “The Ensemble”. 15 / 39 Source: http://www.doksinet The Netflix Prize 2006–2009 41K teams participated! Competition ran for nearly 3 years. Winner “BellKor’s Pragmatic Chaos”, essentially tied with “The Ensemble”. ⊃ our Lester Mackey 15 / 39 Source: http://www.doksinet 4 ? 1 . . V 2 1 5 2 . . mo vie I 1 ? mo vie I . . A B C D E mo vie I User User User User User mo vie I I II The Netflix Data Set ? 5 3 2 1 ? ? ? ? . . . . 4 3 • Training Data: 480K users, 18K movies, 100M ratings (1–5) (99% ratings missing) • Goal: ··· $1M prize for 10% reduction ··· in RMSE over Cinematch ··· ··· • BellKor’s Pragmatic Chaos ··· declared winners

on ··· 9/21/2009 . . Used ensemble of models, an important ingredient being low-rank factorization (SVD) 16 / 39 Source: http://www.doksinet Strategies for modeling big data Once the data have been cleaned and organized, we are often left with a massive matrix of observations. • If data are sparse (lots of zeros or NAs), store using sparse-matrix methods. 17 / 39 Source: http://www.doksinet Strategies for modeling big data Once the data have been cleaned and organized, we are often left with a massive matrix of observations. • If data are sparse (lots of zeros or NAs), store using sparse-matrix methods. Quantcast example next: fit a sequence of logistic regression models using glmnet in R with 54M rows and 7M predictors. Extremely sparse X matrix, stored in memory (256G) took 2 hours to fit 100 models of increasing complexity. 17 / 39 Source: http://www.doksinet Strategies for modeling big data Once the data have been cleaned and organized, we are often left with

a massive matrix of observations. • If data are sparse (lots of zeros or NAs), store using sparse-matrix methods. Quantcast example next: fit a sequence of logistic regression models using glmnet in R with 54M rows and 7M predictors. Extremely sparse X matrix, stored in memory (256G) took 2 hours to fit 100 models of increasing complexity. • If not sparse, use distributed, compressed databases. Many groups are developing fast algorithms and interfaces to these databases. 17 / 39 Source: http://www.doksinet Strategies for modeling big data Once the data have been cleaned and organized, we are often left with a massive matrix of observations. • If data are sparse (lots of zeros or NAs), store using sparse-matrix methods. Quantcast example next: fit a sequence of logistic regression models using glmnet in R with 54M rows and 7M predictors. Extremely sparse X matrix, stored in memory (256G) took 2 hours to fit 100 models of increasing complexity. • If not sparse, use

distributed, compressed databases. Many groups are developing fast algorithms and interfaces to these databases. For example H2O [CRAN] by H2 O interfaces from R to highly compressed versions of data, using Java-based implementations of many of the important modeling tools. 17 / 39 Source: http://www.doksinet glmnet Fit regularization paths for a variety of GLMs with lasso and elastic net penalties; e.g logistic regression p X Pr(Y = 1 | X = x) = β0 + xj β j log Pr(Y = 0 | X = x) j=1 • Lasso penalty [Tibshirani, 1996] induces sparsity in Pp coefficients: j=1 |βj | ≤ s. It shrinks them toward zero, and sets many to zero. • Fit efficiently using coordinate descent. Handles sparse X naturally, and exploits sparsity of solutions, warms starts, variable screening, and includes methods for model selection using cross-validation. glmnet team: TH, Jerome Friedman, Rob Tibshirani, Noah Simon, Junyang Qian. 18 / 39 Source: http://www.doksinet Example: Large Sparse Logistic

Regression Quantcast is a digital marketing company.∗ Data are five-minute internet sessions. Binary target is type of family (≤ 2 adults vs adults plus children). 7 million features of session info (web page indicators and descriptors). Divided into training set (54M), validation (5M) and test (5M). • All but 1.1M features could be screened because ≤ 3 nonzero values. • Fit 100 models in 2 hours in R using glmnet. • Richest model had 42K nonzero coefficients, and explained 10% deviance (like R-squared). ∗ TH on SAB 19 / 39 Source: http://www.doksinet 0.220 0.225 0.215 Misclassification Error 0.230 54M train, 5M val, 5M test 0.00 0.02 0.04 Validation Test Train 0.06 0.08 0.10 % Deviance Explained on Training Data 20 / 39 0.45 0.50 Mon Tue Wed Thu Fri Sat Sun 0.40 Pr(Family with

Children | Day/Time) 0.55 Source: http://www.doksinet 5 10 15 20 Hour of Day 21 / 39 Source: http://www.doksinet ∗ TH on SAB 22 / 39 Source: http://www.doksinet Strategies for modeling big data • Online (stochastic) learning algorithms are popular need not keep data in memory. 23 / 39 Source: http://www.doksinet Strategies for modeling big data • Online (stochastic) learning algorithms are popular need not keep data in memory. • Subsample if possible! 23 / 39 Source: http://www.doksinet Strategies for modeling big data • Online (stochastic) learning algorithms are popular need not keep data in memory. • Subsample if possible! When modeling click-through rate, there is typically 1 positive example per 10,000 negatives. You do not need all the negatives, because beyond some point the variance comes from the paucity of positives. 1 in 15 is sufficient. Will Fithian and TH (2014, Annals of Statistics) Local CaseControl Sampling: Efficient

Subsampling in Imbalanced Data Sets 23 / 39 Source: http://www.doksinet Strategies for modeling big data • Online (stochastic) learning algorithms are popular need not keep data in memory. • Subsample if possible! When modeling click-through rate, there is typically 1 positive example per 10,000 negatives. You do not need all the negatives, because beyond some point the variance comes from the paucity of positives. 1 in 15 is sufficient. Will Fithian and TH (2014, Annals of Statistics) Local CaseControl Sampling: Efficient Subsampling in Imbalanced Data Sets • Think out of the box! 23 / 39 Source: http://www.doksinet Strategies for modeling big data • Online (stochastic) learning algorithms are popular need not keep data in memory. • Subsample if possible! When modeling click-through rate, there is typically 1 positive example per 10,000 negatives. You do not need all the negatives, because beyond some point the variance comes from the paucity of positives. 1

in 15 is sufficient. Will Fithian and TH (2014, Annals of Statistics) Local CaseControl Sampling: Efficient Subsampling in Imbalanced Data Sets • Think out of the box! How much accuracy do you need? Timeliness can play a role, as well as the ability to explore different approaches. Explorations can be done on subsets of the data. 23 / 39 Source: http://www.doksinet 0.8

Work with Brad Efron 0.7 Full Separate Spraygun 0.6

5e−05 1e−04 5e−06 1e−05 0.5 Relative Mean−Square Test Error 0.9 1.0 Thinking out the Box: Spraygun 5e−04 1e−03 5e−03 1e−02 5e−02 Beer ratings 1.4M ratings 0.75M vars (sparse document features) λ Lasso regression path: 70 mins. Split data into 25 parts, distribute, and average: 30 secs. In addition, free prediction standard errors and CV error. 24 / 39 Source: http://www.doksinet Predicting the Pathogenicity of Missense Variants Goal: prioritize list of candidate genes for prostate cancer Joint work with Epidemiology colleagues Weiva Sieh, Joe Rothstein, Nilah Monnier Ioannidis, and Alice Whittemore 25 / 39 Source: http://www.doksinet Approach • A number of existing scores for disease status do not always agree (e.g SIFT, Polyphen) • Idea is to use a Random Forest algorithm to integrate these scores into a single consensus score for predicting disease. • We will use

existing functional prediction scores, conservation scores, etc as features 12 features in all. • Data acquired through SwissVar. 52K variants classified as disease 21K variants neutral 31K variants 26 / 39 Source: http://www.doksinet Correlation of Features F1 F2 F3 PP 2 PP HV 2 M HD T LR T SI FT Si Ph ph y yl G oP ER SL P+ R + F2 F1 Correlaon  of  Features   1 0.9 F3 PP2 HV 0.8 PP2 HD MT LRT SIFT SiPhy 0.7 0.6 0.5 phyloP GERP++ SLR 0.4 0.3 27 / 39 Source: http://www.doksinet Decision Trees SIFT > .9 x SLR > .8 LRT > .8 x GERP >.2 x SIFT > .5 Pr(D)=.65 Pr(D)=60 x x Pr(D)=.95 Pr(D)=.75 Pr(D)=.55 Pr(D)=.25 Pr(D)=.75 Trees use the features to create subgroups in the data to refine the estimate of disease. 28 / 39 Source: http://www.doksinet Decision Trees SIFT > .9 x SLR > .8 LRT > .8 x GERP >.2 x SIFT > .5 Pr(D)=.65 Pr(D)=60 x x Pr(D)=.95 Pr(D)=.75 Pr(D)=.55 Pr(D)=.25 Pr(D)=.75 Trees use the

features to create subgroups in the data to refine the estimate of disease. Shallow trees are too coarse/inaccurate 28 / 39 Source: http://www.doksinet Random Forests Leo Breiman (1928–2005) • Deep trees (fine subgroups) are more accurate, but very noisy. • Idea: fit many (1000s) different and very-deep trees, and average their predictions to reduce the noise. • How to get different trees? - Grow trees to bootstrap subsampled versions of the data. - Randomly ignore variables as candidates for splits. Random Forests are very effective and give accurate predictions. They are automatic, and give good CV estimates of prediction error (for free!). R package RandomForest 29 / 39 All-Disease Random Forest Results for Random Forests 0.6 0.4 0.0 0.2 True Positive Rate 0.8 1.0 Source: http://www.doksinet 0.0 0.2 0.4 0.6 0.8 1.0 False Positive Rate Performance evaluated using votes for: for: Performance evaluated using OOBout-of-bag (out-of-bag) predictions •

•AllAll disease (AUC0.984) 0.984) disease & vsneutral neutral variants variants (AUC • •Cancer (AUC 0.935) 0.935) Cancer&vsneutral neutralvariants variants (AUC 30 / 39 Source: http://www.doksinet Feature   FeatureImportance   Importance F1 All Disease Cancer 0.3 SLR GERP++ phyloP SiPhy SIFT LRT MT PP2 HD PP2 HV 0.1 F3 0.2 F2 Relative Feature Importance 0.4 0.0 31 / 39 Source: http://www.doksinet Two New Methods Glinternet With past PhD student Michael Lim (JCGS 2014). Main effect + two-factor interaction models selected using the group lasso. Gamsel With past Ph.D student Alexandra Chouldechova, using overlap group lasso Automatic, sticky selection between zero, linear or nonlinear terms P in GAMs: η(x) = pj=1 fj (xj ) 32 / 39 Source: http://www.doksinet Glinternet Example: GWAS with p = 27K Snps , each a 3-level factor, and a binary response, N = 3500. • Let Xj be N × 3 indicator matrix for each Snp, and Xj:k = Xj ? Xk be the N ×

9 interaction matrix. • We fit model p X X Pr(Y = 1|X) =α+ log Xj βj + Xj:k θj:k Pr(Y = 0|X) j=1 j<k • note: Xj:k encodes main effects and interactions. • Maximize group-lasso penalized likelihood:   p X X kθj:k k2  `(y, p) − λ  kβj k2 + j=1 j<k • Solutions map to traditional hierarchical main-effects/interactions model (with effects summing to zero). 33 / 39 Source: http://www.doksinet Glinternet (continued) • Strong rules for feature filtering essential here parallel and distributed computing useful too. GWAS search space of 729M interactions! • Formulated for all types of interactions, not just categorical variables. • Glinternet very fast two-orders of magnitude faster than competition, with similar performance. 34 / 39 Source: http://www.doksinet Example: Mining Electronic Health Records for Synergistic Drug Combinations Using Oncoshare database (EHR from Stanford Hospital and Palo Alto Medical Foundation) looked for

synergistic effects between 296 drugs in treatment of 9,945 breast cancer patients. Used glinternet to discover three potential synergies. Joint work with Yen Low, Michael Lim, TH, Nigam Shah and others. 35 / 39 Source: http://www.doksinet Ÿ Demographic variable Ÿ Tumor variable Ÿ Comorbidity variable Ÿ Treatment variable Ÿ Drug variable Ÿ Drug class variable 36 / 39 Source: http://www.doksinet Gamsel: Generalized Additive Model Selection p p X X 1 y− αj xj − Uj β j 2 j=1 2 + λ p n o X (1 − γ)|αj | + γkβj kDj∗ j=1 j=1 p + 1X ψj kβj k2Dj 2 j=1 • Uj = [xj p1 (xj ) · · · pk (xj )] where the pi are orthogonal Demmler-Reinsch spline basis functions of increasing degree. • Dj = diag(dj0 , dj1 , . , djk ) diagonal penalty matrix with 0 = dj0 < dj1 ≤ dj2 ≤ · · · ≤ djk , and Dj∗ = Dj but with dj0 = dj1 . 37 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11

2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 1 lambda = 125.43 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04

v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 2 lambda = 114.18 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 3 lambda = 103.94 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4

−0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 4 lambda = 94.61 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4

f(v1) 0 2 Step= 5 lambda = 86.13 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 6 lambda = 78.4 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0

2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 7 lambda = 71.37 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 8 lambda = 64.97 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12

38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 9 lambda = 59.14 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4

−0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 10 lambda = 53.83 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 11 lambda = 49.01 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04

0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 12 lambda = 44.61 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0

2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 13 lambda = 40.61 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 14 lambda = 36.97 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6)

0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 15 lambda = 33.65 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0

f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 16 lambda = 30.63 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 17 lambda = 27.88 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04

−4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 18 lambda = 25.38 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 19 lambda = 23.11 −0.04 0.00

v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 20 lambda = 21.03 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2

0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 21 lambda = 19.15 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 22 lambda = 17.43 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2

−2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 23 lambda = 15.87 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2

f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 24 lambda = 14.44 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 25 lambda = 13.15 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6

−2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 26 lambda = 11.97 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2

−0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 27 lambda = 10.89 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 28 lambda = 9.92 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2

−0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 29 lambda = 9.03 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step=

30 lambda = 8.22 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 31 lambda = 7.48 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0

2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 32 lambda = 6.81 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 33 lambda = 6.2 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source:

http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 34 lambda = 5.64 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04

0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 35 lambda = 5.14 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 36 lambda = 4.68 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2

v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 37 lambda = 4.26 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2

0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 38 lambda = 3.87 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 39 lambda = 3.53 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04

−4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 40 lambda = 3.21 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2

−4 f(v1) 0 2 Step= 41 lambda = 2.92 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 42 lambda = 2.66 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4

0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 43 lambda = 2.42 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 44 lambda = 2.2 −0.04 0.00 v9 0.04 −0.04 0.00

0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 45 lambda = 2.01 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04

−4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 46 lambda = 1.83 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 47 lambda = 1.66 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04

0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 48 lambda = 1.51 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4

−0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 49 lambda = 1.38 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet 0.04 2 −2 f(v10) 2 0 −0.04 0.04 0.00 0.04 f(v12) 0 2 v11 2 −4 f(v9) v6 −2 f(v11) 0.04 −4 f(v6) 0.00 0 2 0.00 0.04 −4 −0.04 v8 −2 −0.04 0.00 v10 2 f(v8) 0.04 −4 0.04 −0.06 −4 0.00 0 2 0 v3 0.04 0 2 f(v5) −2 −0.04 v5 −2 0.00 0.00 v7 −4 0.04 −4 −0.04 −4 −0.04 0 2 0 f(v2) −2 0.00 v2 f(v3) 0.00 v4 −4 −0.04 0 2 −4 −0.04 −2 0.04 v1 −2 0.00 −2 −0.06 −2 f(v7) 0 2 0 f(v4) −2 −4 −2 −4 f(v1) 0 2 Step= 50 lambda = 1.25 −0.04 0.00 v9 0.04 −0.04 0.00 0.04 v12 38 / 39 Source: http://www.doksinet useR! 2016 All the tools I described are implemented in R, which is wonderful free software that gets increasingly

more powerful as it interfaces with other systems. R can be found on CRAN: http://cran.usr-projectorg 27–30 June 2016, R user conference at Stanford! 39 / 39 Source: http://www.doksinet useR! 2016 All the tools I described are implemented in R, which is wonderful free software that gets increasingly more powerful as it interfaces with other systems. R can be found on CRAN: http://cran.usr-projectorg 27–30 June 2016, R user conference at Stanford! · · · and now for some cheap marketing . 39 / 39 Source: http://www.doksinet useR! 2016 All the tools I described are implemented in R, which is wonderful free software that gets increasingly more powerful as it interfaces with other systems. R can be found on CRAN: http://cran.usr-projectorg 27–30 June 2016, R user conference at Stanford! · · · and now for some cheap marketing . with Applications in R Daniela Witten is an assistant professor of biostatistics at University of Washington. Her research focuses largely

on high-dimensional statistical machine learning. She has contributed to the translation of statistical learning techniques to the field of genomics, through collaborations and as a member of the Institute of Medicine committee that led to the report Evolution of Translational Omics. Trevor Hastie and Robert Tibshirani are professors of statistics at Stanford University, and are co-authors of the successful textbook Elements of Statistical Learning. Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie co-developed much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Statistics ISBN 978-1-4614-7137-0 Springer Texts inSpringer Statistics Series in Statistics Gareth James Daniela Witten Trevor Hastie • Robert Tibshirani • Jerome Friedman Trevor Hastie The Elements

of Statictical Learning Robert Tibshirani An Introduction to Statistical Learning During the past decade there has been an explosion in computation and information technology. With it have come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It should be a valuable resource for statisticians and anyone interested in data mining in science or industry. The book’s coverage is broad, from supervised learning (prediction)

to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boostingthe first comprehensive treatment of this topic in any book. This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression & path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for “wide” data (p bigger than n), including multiple testing and false discovery rates. with Applications in R Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie codeveloped much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed

the lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many datamining tools including CART, MARS, projection pursuit and gradient boosting S TAT I S T I C S  ---- 9 781461 471370 › springer.com The Elements of Statistical Learning published an extensive body of methodological work in the domain of statistical learning with particular emphasis on high-dimensional and functional data. The conceptual framework for this book grew out of his MBA elective courses in this area. 1 An Introduction to Statistical Learning Two of the authors co-wrote The Elements of Statistical Learning (Hastie, Tibshirani and Friedman, 2nd edition 2009), a popular reference book for statistics and machine learning researchers. An Introduction to Statistical Learning covers many of the same topics, but at a level accessible to a much broader audience. This book is targeted at statisticians and

non-statisticians alike who wish to use cutting-edge statistical learning techniques to analyze their data. The text assumes only a previous course in linear regression and no knowledge of matrix algebra. Gareth James is a professor of statistics at University of Southern California. He has STS Hastie • Tibshirani • Friedman Gareth James · Daniela Witten · Trevor Hastie · Robert Tibshirani An Introduction to Statistical Learning An Introduction to Statistical Learning provides an accessible overview of the field of statistical learning, an essential toolset for making sense of the vast and complex data sets that have emerged in fields ranging from biology to finance to marketing to astrophysics in the past twenty years. This book presents some of the most important modeling and prediction techniques, along with relevant applications. Topics include linear regression, classification, resampling methods, shrinkage approaches, tree-based methods, support vector machines,

clustering, and more. Color graphics and real-world examples are used to illustrate the methods presented. Since the goal of this textbook is to facilitate the use of these statistical learning techniques by practitioners in science, industry, and other fields, each chapter contains a tutorial on implementing the analyses and methods presented in R, an extremely popular open source statistical software platform. James · Witten · Hastie · Tibshirani Springer Texts in Statistics Springer Series in Statistics Trevor Hastie Robert Tibshirani Jerome Friedman The Elements of Statistical Learning Data Mining, Inference, and Prediction Second Edition 39 / 39 Source: http://www.doksinet useR! 2016 All the tools I described are implemented in R, which is wonderful free software that gets increasingly more powerful as it interfaces with other systems. R can be found on CRAN: http://cran.usr-projectorg 27–30 June 2016, R user conference at Stanford! · · · and now for some cheap

marketing . with Applications in R Daniela Witten is an assistant professor of biostatistics at University of Washington. Her research focuses largely on high-dimensional statistical machine learning. She has contributed to the translation of statistical learning techniques to the field of genomics, through collaborations and as a member of the Institute of Medicine committee that led to the report Evolution of Translational Omics. Trevor Hastie and Robert Tibshirani are professors of statistics at Stanford University, and are co-authors of the successful textbook Elements of Statistical Learning. Hastie and Tibshirani developed generalized additive models and wrote a popular book of that title. Hastie co-developed much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Statistics ISBN 978-1-4614-7137-0 Springer Texts

inSpringer Statistics Series in Statistics Gareth James Daniela Witten Trevor Hastie • Robert Tibshirani • Jerome Friedman Trevor Hastie The Elements of Statictical Learning Robert Tibshirani An Introduction to Statistical Learning During the past decade there has been an explosion in computation and information technology. With it have come vast amounts of data in a variety of fields such as medicine, biology, finance, and marketing The challenge of understanding these data has led to the development of new tools in the field of statistics, and spawned new areas such as data mining, machine learning, and bioinformatics. Many of these tools have common underpinnings but are often expressed with different terminology. This book describes the important ideas in these areas in a common conceptual framework. While the approach is statistical, the emphasis is on concepts rather than mathematics. Many examples are given, with a liberal use of color graphics. It should be a valuable

resource for statisticians and anyone interested in data mining in science or industry. The book’s coverage is broad, from supervised learning (prediction) to unsupervised learning. The many topics include neural networks, support vector machines, classification trees and boostingthe first comprehensive treatment of this topic in any book. This major new edition features many topics not covered in the original, including graphical models, random forests, ensemble methods, least angle regression & path algorithms for the lasso, non-negative matrix factorization, and spectral clustering. There is also a chapter on methods for “wide” data (p bigger than n), including multiple testing and false discovery rates. with Applications in R Trevor Hastie, Robert Tibshirani, and Jerome Friedman are professors of statistics at Stanford University. They are prominent researchers in this area: Hastie and Tibshirani developed generalized additive models and wrote a popular book of that

title. Hastie codeveloped much of the statistical modeling software and environment in R/S-PLUS and invented principal curves and surfaces. Tibshirani proposed the lasso and is co-author of the very successful An Introduction to the Bootstrap. Friedman is the co-inventor of many datamining tools including CART, MARS, projection pursuit and gradient boosting S TAT I S T I C S  ---- 9 781461 471370 › springer.com The Elements of Statistical Learning published an extensive body of methodological work in the domain of statistical learning with particular emphasis on high-dimensional and functional data. The conceptual framework for this book grew out of his MBA elective courses in this area. 1 An Introduction to Statistical Learning Two of the authors co-wrote The Elements of Statistical Learning (Hastie, Tibshirani and Friedman, 2nd edition 2009), a popular reference book for statistics and machine learning researchers. An

Introduction to Statistical Learning covers many of the same topics, but at a level accessible to a much broader audience. This book is targeted at statisticians and non-statisticians alike who wish to use cutting-edge statistical learning techniques to analyze their data. The text assumes only a previous course in linear regression and no knowledge of matrix algebra. Gareth James is a professor of statistics at University of Southern California. He has STS Hastie • Tibshirani • Friedman Gareth James · Daniela Witten · Trevor Hastie · Robert Tibshirani An Introduction to Statistical Learning An Introduction to Statistical Learning provides an accessible overview of the field of statistical learning, an essential toolset for making sense of the vast and complex data sets that have emerged in fields ranging from biology to finance to marketing to astrophysics in the past twenty years. This book presents some of the most important modeling and prediction techniques, along

with relevant applications. Topics include linear regression, classification, resampling methods, shrinkage approaches, tree-based methods, support vector machines, clustering, and more. Color graphics and real-world examples are used to illustrate the methods presented. Since the goal of this textbook is to facilitate the use of these statistical learning techniques by practitioners in science, industry, and other fields, each chapter contains a tutorial on implementing the analyses and methods presented in R, an extremely popular open source statistical software platform. James · Witten · Hastie · Tibshirani Springer Texts in Statistics Springer Series in Statistics Trevor Hastie Robert Tibshirani Jerome Friedman The Elements of Statistical Learning Data Mining, Inference, and Prediction Second Edition Thank you! 39 / 39