John Ehlers 1 AfTA December 11, 2007 Left-Brained Concepts for Traders in their Right Minds.

Slides:



Advertisements
Similar presentations
Agenda of Week V. Dispersion & RV Objective : Understanding the descriptive statistics Understanding the random variable and probability Week 4 1 Graphs.
Advertisements

A real-time adaptive trading system using Genetic Programming QF5205 : Topics in Quantitative Finance Donny Lee Nadim Mouchonnet.
The webinar slides (including code) can be found at:
Activities Tab – Charles H. Dow Award
ENGG 2040C: Probability Models and Applications Andrej Bogdanov Spring Limit theorems.
Sharpen Your Trading with the Fisher Transform Presented by John Ehlers.
Probability Distributions CSLU 2850.Lo1 Spring 2008 Cameron McInally Fordham University May contain work from the Creative Commons.
Not Rocket Science – An Intuitive New Display
Random Sampling and Data Description
6-1 Stats Unit 6 Sampling Distributions and Statistical Inference - 1 FPP Chapters 16-18, 20-21, 23 The Law of Averages (Ch 16) Box Models (Ch 16) Sampling.
Measures of Dispersion
SPECTRAL DILATION Codifying the Fractal Nature of Market Data Impact on Technical Indicators StockSpotter.com John Ehlers
Continuous Distributions Chapter 6 MSIS 111 Prof. Nick Dedeke.
Business Statistics: A Decision-Making Approach, 7e © 2008 Prentice-Hall, Inc. Chap 3-1 Business Statistics: A Decision-Making Approach 7 th Edition Chapter.
Part 9: Normal Distribution 9-1/47 Statistics and Data Analysis Professor William Greene Stern School of Business IOMS Department Department of Economics.
Business Statistics: A Decision-Making Approach, 7e © 2008 Prentice-Hall, Inc. Chap 3-1 Business Statistics: A Decision-Making Approach 7 th Edition Chapter.
Chapter 6 Continuous Random Variables and Probability Distributions
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
Part III: Inference Topic 6 Sampling and Sampling Distributions
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 6-1 Chapter 6 The Normal Distribution and Other Continuous Distributions.
Chapter 5 Continuous Random Variables and Probability Distributions
7/2/2015 IENG 486 Statistical Quality & Process Control 1 IENG Lecture 05 Interpreting Variation Using Distributions.
Chap 6-1 Statistics for Business and Economics, 6e © 2007 Pearson Education, Inc. Chapter 6 Continuous Random Variables and Probability Distributions Statistics.
Ka-fu Wong © 2004 ECON1003: Analysis of Economic Data Lesson6-1 Lesson 6: Sampling Methods and the Central Limit Theorem.
12.3 – Measures of Dispersion
Lecture II-2: Probability Review
11/5/2003Probability and Statistics for Teachers, Math 507, Lecture 10 1 UNIFORM AND EXPONENTIAL RANDOM VARIABLES Sections
Chapter 4 Continuous Random Variables and Probability Distributions
1 Sampling Distributions Presentation 2 Sampling Distribution of sample proportions Sampling Distribution of sample means.
Descriptive Statistics
Chap 6-1 Copyright ©2013 Pearson Education, Inc. publishing as Prentice Hall Chapter 6 The Normal Distribution Business Statistics: A First Course 6 th.
B AD 6243: Applied Univariate Statistics Understanding Data and Data Distributions Professor Laku Chidambaram Price College of Business University of Oklahoma.
Chapter 8: Confidence Intervals
Continuous Probability Distributions  Continuous Random Variable  A random variable whose space (set of possible values) is an entire interval of numbers.
Statistics for Data Miners: Part I (continued) S.T. Balke.
Random Sampling, Point Estimation and Maximum Likelihood.
Theory of Probability Statistics for Business and Economics.
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 6-1 Chapter 6 The Normal Distribution and Other Continuous Distributions.
1 The Instantaneous Trendline AfTA 20 May 2003 John Ehlers.
1 Topic 4 - Continuous distributions Basics of continuous distributions Uniform distribution Normal distribution Gamma distribution.
Copyright © 2014, 2011 Pearson Education, Inc. 1 Chapter 19 Linear Patterns.
1 Elementary Statistics Larson Farber Descriptive Statistics Chapter 2.
Larson/Farber Ch 2 1 Elementary Statistics Larson Farber 2 Descriptive Statistics.
Random Sampling Approximations of E(X), p.m.f, and p.d.f.
Spatial Analysis & Geostatistics Methods of Interpolation Linear interpolation using an equation to compute z at any point on a triangle.
Probability = Relative Frequency. Typical Distribution for a Discrete Variable.
Probability and Statistics in Geology Probability and statistics are an important aspect of Earth Science. Understanding the details, population of a data.
Chapter 6 Simple Regression Introduction Fundamental questions – Is there a relationship between two random variables and how strong is it? – Can.
Statistics What is statistics? Where are statistics used?
CY1B2 Statistics1 (ii) Poisson distribution The Poisson distribution resembles the binomial distribution if the probability of an accident is very small.
Ka-fu Wong © 2003 Chap 6- 1 Dr. Ka-fu Wong ECON1003 Analysis of Economic Data.
Sampling and estimation Petter Mostad
Probability and Distributions. Deterministic vs. Random Processes In deterministic processes, the outcome can be predicted exactly in advance Eg. Force.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
Outline of Today’s Discussion 1.The Distribution of Means (DOM) 2.Hypothesis Testing With The DOM 3.Estimation & Confidence Intervals 4.Confidence Intervals.
Larson/Farber Ch 2 1 Elementary Statistics Larson Farber 2 Descriptive Statistics.
Basic Business Statistics, 10e © 2006 Prentice-Hall, Inc.. Chap 6-1 Chapter 6 The Normal Distribution and Other Continuous Distributions Basic Business.
WARM UP: Penny Sampling 1.) Take a look at the graphs that you made yesterday. What are some intuitive takeaways just from looking at the graphs?
Normal Distribution and Parameter Estimation
Chapter 7 Sampling Distributions.
Chapter 7: Sampling Distributions
Statistics in Applied Science and Technology
3.1 Expectation Expectation Example
Chapter 7 Sampling Distributions.
Chapter 7 Sampling Distributions.
Chapter 7 Sampling Distributions.
Statistical analysis and its application
Chapter 7 Sampling Distributions.
Continuous Random Variables: Basics
Presentation transcript:

John Ehlers 1 AfTA December 11, 2007 Left-Brained Concepts for Traders in their Right Minds

John Ehlers 2 Pioneer of MESA studiesPioneer of MESA studies FuturesTruth has ranked his S&P, Bond, and Currency trading systems #1FuturesTruth has ranked his S&P, Bond, and Currency trading systems #1 Winner 27 Readers’ Choice Awards from Stocks & Commodities magazineWinner 27 Readers’ Choice Awards from Stocks & Commodities magazine Author of MESA and Trading Market CyclesAuthor of MESA and Trading Market Cycles Author of Rocket Science for TradersAuthor of Rocket Science for Traders Author of Cybernetic Analysis for Stocks and FuturesAuthor of Cybernetic Analysis for Stocks and Futures

John Ehlers 3 Hurst Coefficient

John Ehlers 4 Hurst Coefficient Named after H.E. Hurst, not J.M. HurstNamed after H.E. Hurst, not J.M. Hurst –Studied how high to make the Aswan dam on the Nile –Found the range did not widen as as in a coin toss –Rather: Hurst Coefficient is more estimated than computedHurst Coefficient is more estimated than computed –Rescaled range method Log of R/S versus Log of lagLog of R/S versus Log of lag –Aggregated Variance Method N/m blocks of Size m plotted against Log(m)N/m blocks of Size m plotted against Log(m) –Differenced Variance Method Used for long memoryUsed for long memory Aggregated Variance Method seems to work best for market dataAggregated Variance Method seems to work best for market data

John Ehlers 5 Aggregated Variance Method Start with the concept of the Fractal DimensionStart with the concept of the Fractal Dimension Cover a generalized pattern of “N” objects of sizes “S”Cover a generalized pattern of “N” objects of sizes “S” Example 1 –Line 10 meters long. Place boxes on line: Ten 1 meter boxes, one hundred 0.1 meter boxes Therefore N1=10, S1= 1, N2=100, S2=0.1 D = 1.0 Example 2 –Square 10 Meters on a side. Place boxes in the square Now N1=100, N2=10000 D = 2.0

John Ehlers 6 Fractal Dimension of Market Data Since price samples are uniformly spaced, the box count is approximately the average slopeSince price samples are uniformly spaced, the box count is approximately the average slope Box count is estimated as the price range divided by the intervalBox count is estimated as the price range divided by the interval Divide the time into two segmentsDivide the time into two segments – 0 to T and T to 2T –N1 is range over 1 st interval, N2 is range over 2 nd interval, N3 is range over the combined total interval Then:Then:

John Ehlers 7 Hurst Coefficient Display Interpretations:Interpretations: –h = 0 means data are antipersistent (cyclic) –h = 1 means data are persistent (trending) –h = 0.5 means data are random Clearly, Hurst Coefficient depends on the selected lookback periodClearly, Hurst Coefficient depends on the selected lookback period For each bar we will use a range of lookback periods and colorize the value of the Hurst CoefficientFor each bar we will use a range of lookback periods and colorize the value of the Hurst Coefficient –Blue is cyclic –Green is trending –Red is random

John Ehlers 8 Hurst EasyLanguage Code Inputs: Price((H+L)/2), Lookback(60); Vars: I(0), N(0), count(0), N1(0), N2(0), N3(0), HH(0), LL(0), Dimen(0), Color1(0), Color2(0), Color3(0), PlotLen(0); Arrays: H[190](0), H1[100](0), H2[100](0), H3[100](0), H4[100](0), HAvg[100](0); For I = 1 to 50 Begin N = 2*I; N3 = (Highest(High, N) - Lowest(Low, N)) / N; HH = High; LL = Low; For count = 0 to N/2 - 1 begin If High[count] > HH then HH = High[count]; If Low[count] < LL then LL = Low[count]; End; N1 = (HH - LL)/(N / 2); HH = High[N/2]; LL = Low[N/2]; For count = N/2 to N - 1 begin If High[count] > HH then HH = High[count]; If Low[count] < LL then LL = Low[count]; End; N2 = (HH - LL)/(N / 2); If N1 > 0 and N2 > 0 and N3 > 0 then Dimen = (Log(N1 + N2) - Log(N3)) / Log(2); H[N] = 2*(1 / Dimen -.5); H[N] = 1.25*(H[N] -.5) +.6; HAvg[N] = (H[N] + H1[N] + H2[N] + H3[N] + H4[N]) / 5; If HAvg[N] > 1 then HAvg[N] = 1; If HAvg[N] < 0 then HAvg[N] = 0; H4[N] = H3[N]; H3[N] = H2[N]; H2[N] = H1[N]; H1[N] = H[N]; End; For I = 2 to 50 Begin N = 2*I - 1; HAvg[N] = (HAvg[N - 1] + HAvg[N + 1]) / 2; End; //Plot the Rescale-range Statistic as a Heatmap PlotLen = Lookback; If Plotlen > 99 Then PlotLen = 99; For I = 8 to PlotLen Begin //Convert RS to RGB Color for Display If HAvg[I] >=.5 Then Begin Color1 = 255*(2 - 2*HAvg[I]); Color2 = 255*(2*HAvg[I] - 1); Color3 = 0; End Else If HAvg[I] <.5 Then Begin Color1 = 255*(2*HAvg[I]); Color2 = 0; Color3 = 255*(1 - 2*HAvg[I]); End; If I = 4 Then Plot4(4, "S4", RGB(Color1, Color2, Color3),0,4); If I = 5 Then Plot5(5, "S5", RGB(Color1, Color2, Color3),0,4); If I = 6 Then Plot6(6, "S6", RGB(Color1, Color2, Color3),0,4); If I = 7 Then Plot7(7, "S7", RGB(Color1, Color2, Color3),0,4); If I = 8 Then Plot8(8, "S8", RGB(Color1, Color2, Color3),0,4); If I = 9 Then Plot9(9, "S9", RGB(Color1, Color2, Color3),0,4); If I = 10 Then Plot10(10, "S10", RGB(Color1, Color2, Color3),0,4); If I = 11 Then Plot11(11, "S11", RGB(Color1, Color2, Color3),0,4); If I = 12 Then Plot12(12, "S12", RGB(Color1, Color2, Color3),0,4); If I = 13 Then Plot13(13, "S13", RGB(Color1, Color2, Color3),0,4); If I = 14 Then Plot14(14, "S14", RGB(Color1, Color2, Color3),0,4); If I = 15 Then Plot15(15, "S15", RGB(Color1, Color2, Color3),0,4); If I = 16 Then Plot16(16, "S16", RGB(Color1, Color2, Color3),0,4); If I = 17 Then Plot17(17, "S17", RGB(Color1, Color2, Color3),0,4); If I = 18 Then Plot18(18, "S18", RGB(Color1, Color2, Color3),0,4); If I = 19 Then Plot19(19, "S19", RGB(Color1, Color2, Color3),0,4); If I = 20 Then Plot20(20, "S20", RGB(Color1, Color2, Color3),0,4); If I = 21 Then Plot21(21, "S21", RGB(Color1, Color2, Color3),0,4); If I = 22 Then Plot22(22, "S22", RGB(Color1, Color2, Color3),0,4); If I = 23 Then Plot23(23, "S23", RGB(Color1, Color2, Color3),0,4); If I = 24 Then Plot24(24, "S24", RGB(Color1, Color2, Color3),0,4); If I = 25 Then Plot25(25, "S25", RGB(Color1, Color2, Color3),0,4); If I = 26 Then Plot26(26, "S26", RGB(Color1, Color2, Color3),0,4); If I = 27 Then Plot27(27, "S27", RGB(Color1, Color2, Color3),0,4); If I = 28 Then Plot28(28, "S28", RGB(Color1, Color2, Color3),0,4); If I = 29 Then Plot29(29, "S29", RGB(Color1, Color2, Color3),0,4); If I = 30 Then Plot30(30, "S30", RGB(Color1, Color2, Color3),0,4); If I = 31 Then Plot31(31, "S31", RGB(Color1, Color2, Color3),0,4); If I = 32 Then Plot32(32, "S32", RGB(Color1, Color2, Color3),0,4); If I = 33 Then Plot33(33, "S33", RGB(Color1, Color2, Color3),0,4); If I = 34 Then Plot34(34, "S34", RGB(Color1, Color2, Color3),0,4); If I = 35 Then Plot35(35, "S35", RGB(Color1, Color2, Color3),0,4); If I = 36 Then Plot36(36, "S36", RGB(Color1, Color2, Color3),0,4); If I = 37 Then Plot37(37, "S37", RGB(Color1, Color2, Color3),0,4); If I = 38 Then Plot38(38, "S38", RGB(Color1, Color2, Color3),0,4); If I = 39 Then Plot39(39, "S39", RGB(Color1, Color2, Color3),0,4); If I = 40 Then Plot40(40, "S40", RGB(Color1, Color2, Color3),0,4); If I = 41 Then Plot41(41, "S41", RGB(Color1, Color2, Color3),0,4); If I = 42 Then Plot42(42, "S42", RGB(Color1, Color2, Color3),0,4); If I = 43 Then Plot43(43, "S43", RGB(Color1, Color2, Color3),0,4); If I = 44 Then Plot44(44, "S44", RGB(Color1, Color2, Color3),0,4); If I = 45 Then Plot45(45, "S45", RGB(Color1, Color2, Color3),0,4); If I = 46 Then Plot46(46, "S46", RGB(Color1, Color2, Color3),0,4); If I = 47 Then Plot47(47, "S47", RGB(Color1, Color2, Color3),0,4); If I = 48 Then Plot48(48, "S48", RGB(Color1, Color2, Color3),0,4); If I = 49 Then Plot49(49, "S49", RGB(Color1, Color2, Color3),0,4); If I = 50 Then Plot50(50, "S50", RGB(Color1, Color2, Color3),0,4); If I = 51 Then Plot51(51, "S41", RGB(Color1, Color2, Color3),0,4); If I = 52 Then Plot52(52, "S42", RGB(Color1, Color2, Color3),0,4); If I = 53 Then Plot53(53, "S43", RGB(Color1, Color2, Color3),0,4); If I = 54 Then Plot54(54, "S44", RGB(Color1, Color2, Color3),0,4); If I = 55 Then Plot55(55, "S45", RGB(Color1, Color2, Color3),0,4); If I = 56 Then Plot56(56, "S46", RGB(Color1, Color2, Color3),0,4); If I = 57 Then Plot57(57, "S47", RGB(Color1, Color2, Color3),0,4); If I = 58 Then Plot58(58, "S48", RGB(Color1, Color2, Color3),0,4); If I = 59 Then Plot59(59, "S49", RGB(Color1, Color2, Color3),0,4); If I = 60 Then Plot60(60, "S50", RGB(Color1, Color2, Color3),0,4); If I = 61 Then Plot61(61, "S41", RGB(Color1, Color2, Color3),0,4); If I = 62 Then Plot62(62, "S42", RGB(Color1, Color2, Color3),0,4); If I = 63 Then Plot63(63, "S43", RGB(Color1, Color2, Color3),0,4); If I = 64 Then Plot64(64, "S44", RGB(Color1, Color2, Color3),0,4); If I = 65 Then Plot65(65, "S45", RGB(Color1, Color2, Color3),0,4); If I = 66 Then Plot66(66, "S46", RGB(Color1, Color2, Color3),0,4); If I = 67 Then Plot67(67, "S47", RGB(Color1, Color2, Color3),0,4); If I = 68 Then Plot68(68, "S48", RGB(Color1, Color2, Color3),0,4); If I = 69 Then Plot69(69, "S49", RGB(Color1, Color2, Color3),0,4); If I = 70 Then Plot70(70, "S50", RGB(Color1, Color2, Color3),0,4); If I = 71 Then Plot71(71, "S41", RGB(Color1, Color2, Color3),0,4); If I = 72 Then Plot72(72, "S42", RGB(Color1, Color2, Color3),0,4); If I = 73 Then Plot73(73, "S43", RGB(Color1, Color2, Color3),0,4); If I = 74 Then Plot74(74, "S44", RGB(Color1, Color2, Color3),0,4); If I = 75 Then Plot75(75, "S45", RGB(Color1, Color2, Color3),0,4); If I = 76 Then Plot76(76, "S46", RGB(Color1, Color2, Color3),0,4); If I = 77 Then Plot77(77, "S47", RGB(Color1, Color2, Color3),0,4); If I = 78 Then Plot78(78, "S48", RGB(Color1, Color2, Color3),0,4); If I = 79 Then Plot79(79, "S49", RGB(Color1, Color2, Color3),0,4); If I = 80 Then Plot80(80, "S50", RGB(Color1, Color2, Color3),0,4); If I = 81 Then Plot81(81, "S41", RGB(Color1, Color2, Color3),0,4); If I = 82 Then Plot82(82, "S42", RGB(Color1, Color2, Color3),0,4); If I = 83 Then Plot83(83, "S43", RGB(Color1, Color2, Color3),0,4); If I = 84 Then Plot84(84, "S44", RGB(Color1, Color2, Color3),0,4); If I = 85 Then Plot85(85, "S45", RGB(Color1, Color2, Color3),0,4); If I = 86 Then Plot86(86, "S46", RGB(Color1, Color2, Color3),0,4); If I = 87 Then Plot87(87, "S47", RGB(Color1, Color2, Color3),0,4); If I = 88 Then Plot88(88, "S48", RGB(Color1, Color2, Color3),0,4); If I = 89 Then Plot89(89, "S49", RGB(Color1, Color2, Color3),0,4); If I = 90 Then Plot90(90, "S50", RGB(Color1, Color2, Color3),0,4); If I = 91 Then Plot91(91, "S41", RGB(Color1, Color2, Color3),0,4); If I = 92 Then Plot92(92, "S42", RGB(Color1, Color2, Color3),0,4); If I = 93 Then Plot93(93, "S43", RGB(Color1, Color2, Color3),0,4); If I = 94 Then Plot94(94, "S44", RGB(Color1, Color2, Color3),0,4); If I = 95 Then Plot95(95, "S45", RGB(Color1, Color2, Color3),0,4); If I = 96 Then Plot96(96, "S46", RGB(Color1, Color2, Color3),0,4); If I = 97 Then Plot97(97, "S47", RGB(Color1, Color2, Color3),0,4); If I = 98 Then Plot98(98, "S48", RGB(Color1, Color2, Color3),0,4); If I = 99 Then Plot99(99, "S49", RGB(Color1, Color2, Color3),0,4); End;

John Ehlers 9 Hurst Coefficient Display S&P Futures for 2007

John Ehlers 10 Probability of Losing

John Ehlers 11 Statistics Soapbox A good trading system has, say, 60% winnersA good trading system has, say, 60% winners –Therefore it has 40% losing trades –q = 0.4 q = r + 2r 2 + 3r 3 + 4r 4 + 5r 5 + …….q = r + 2r 2 + 3r 3 + 4r 4 + 5r 5 + ……. If q = 0.4 then r = If q = 0.4 then r = Probability of getting 4 losers in a row is 4r 4 =0.0122Probability of getting 4 losers in a row is 4r 4 = If you trade 50 times per year, the probability of getting 4 losers in a row is 60.9%If you trade 50 times per year, the probability of getting 4 losers in a row is 60.9% –That’s almost a promise it will happen The message is that traders should not abandon a winning system in times of adversityThe message is that traders should not abandon a winning system in times of adversity Corollary: A trading system with high percentage winners is crucial for retaining customersCorollary: A trading system with high percentage winners is crucial for retaining customers

John Ehlers 12 Bertrand’s Ballot Theorem If candidate A ultimately gets “a” votes and candidate B ultimately gets “b” votes (a>b), then the probability of Candidate A leading throughout the ballot counting process is (a-b) / (a+b)If candidate A ultimately gets “a” votes and candidate B ultimately gets “b” votes (a>b), then the probability of Candidate A leading throughout the ballot counting process is (a-b) / (a+b) In our case, let a = %*PF and b = (1-%). That is, if you win, you win by the Profit Factor. If you lose, you lose 1.In our case, let a = %*PF and b = (1-%). That is, if you win, you win by the Profit Factor. If you lose, you lose 1. PF must be greater than 2 (even then % must be certainty)PF must be greater than 2 (even then % must be certainty) Conclusion: It is almost a promise your account will go underwater some time after you start trading!Conclusion: It is almost a promise your account will go underwater some time after you start trading!

John Ehlers 13 Probability Density Functions

John Ehlers 14 Technical Analysis is Based on Probability “The market is oversold because the Stochastic has been high, so when it crosses through 80 then......”“The market is oversold because the Stochastic has been high, so when it crosses through 80 then......” “When the head-and-shoulders pattern is complete then......”“When the head-and-shoulders pattern is complete then......” “When the market breaks above the upper channel then......”“When the market breaks above the upper channel then......” Let’s attack probability directly Why fool around with rules?

John Ehlers 15 Normal (Gaussian) Probability Distribution Function (PDF) is Commonly Assumed for Market Data Normal PDF Cumulative Normal PDF 0 = 50% +1  = 85% +2  = 98% +3  = 99.9% Normal PDF is attractive because it can be achieved using several random variables due to the central limit theorem But is Normal the right PDF for market data?

John Ehlers 16 The PDF Depends on the Market Waveshape Square Wave Sine Wave PDF Sine Wave Binary PDF of Square Wave

John Ehlers 17 How Do We Determine the Market PDF? Create the waveform by stringing beads on a horizontal wire frame Rotate wire frame to enable beads to stack up Height of the bead stacks is the PDF of the Waveform

John Ehlers 18 Channel Limited PDF Generator Code Inputs: Length(20); Vars: HH(0), LL(0), J(0), I(0); Arrays: Filt[2000](0), Bin[100](0); HH = Close; LL = Close; For I = 0 to Length -1 Begin If Close[I] > HH then HH = Close[I]; If Close[I] < LL then LL = Close[I]; End; If HH <> LL Then Value1 = (Close - LL) / (HH - LL); Filt[CurrentBar] = (Value1 + 2*Value1[1] + Value1[2]) / 4; For I = 0 to 100 Begin If Filt[J] >= I/100 and Filt[J] < (I + 1)/100 Then Bin[I] = Bin[I]+1; End; For I = 0 to 99 Begin Print(File("c:\tsgrowth\pdf.csv"), I, ",", Bin[I]); End; Plot1(Filt[CurrentBar]);

John Ehlers 19 Channel PDF for Treasury Bonds Channel PDF for Treasury Bonds 20 Bar Channel over 30 Years 40 Bar Channel over 30 Years

John Ehlers 20 Highpass Filter PDF Generator Code Inputs: HPPeriod(40); Vars: alpha(0), HP(0), HH(0), LL(0), Count(0), Psn(0), I(0); Arrays: Bin[100](0); alpha = (1 - Sine (360 / HPPeriod)) / Cosine(360 / HPPeriod); HP =.5*(1 + alpha)*(Close - Close[1]) + alpha*HP[1]; IF CurrentBar = 1 THEN HP = 0; If CurrentBar > HPPeriod Then Begin HH = HP; LL = HP; For Count = 0 to HPPeriod -1 Begin If HP[Count] > HH Then HH = HP[Count]; If HP[Count] < LL Then LL = HP[Count]; End; If HH <> LL Then Value1 = 100*(HP - LL) / (HH - LL); Psn = (Value1 + 2*Value1[1] + Value1[2]) / 4; For I = 1 to 100 Begin If Psn > I - 1 and Psn <= I Then Bin[I] = Bin[I] + 1; End; Plot1(Psn); End; If LastBarOnChart Then Begin For I = 1 to 99 Begin Print(File("C:\TSGrowth\PDF_HP.CSV"), I, ",", Bin[I]); End;

John Ehlers 21 HP Filtered PDF for Treasury Bonds HP Filtered PDF for Treasury Bonds 40 Bar Cutoff over 30 Years

John Ehlers 22 MyRSI PDF Generator Code Inputs: Length(10); Vars: CU(0), CD(0), I(0), MyRSI(0), Psn(0); Arrays: Bin[100](0), PDF[100](0); If CurrentBar > Length Then Begin CU = 0; CD = 0; For I = 0 to Length -1 Begin If Close[I] - Close[I + 1] > 0 Then CU = CU + Close[I] - Close[I + 1]; If Close[I] - Close[I + 1] < 0 Then CD = CD + Close[I + 1] - Close[I]; End; If CU + CD <> 0 Then MyRSI = 50*((CU - CD) / (CU + CD) + 1); Psn = (MyRSI + 2*MyRSI[1] + MyRSI[2]) / 4; For I = 1 to 100 Begin If Psn > I - 1 and Psn <= I Then Bin[I] = Bin[I] + 1; End; If LastBarOnChart Then Begin For I = 1 to 99 Begin Print(File("C:\TSGrowth\PDF_RSI.CSV"), I, ",", PDF[I]); End;

John Ehlers 23 MyRSI PDF for Treasury Bonds MyRSI PDF for Treasury Bonds 10 Bar RSI over 30 Years

John Ehlers 24 PDF Conclusions Probability Density Functions can vary widely, depending on the preprocessing usedProbability Density Functions can vary widely, depending on the preprocessing used A practical and useful trading system can be developed by anticipating turning points knowing further excursions are low probability eventsA practical and useful trading system can be developed by anticipating turning points knowing further excursions are low probability events

John Ehlers 25 Fisher Transform A PDF of virtually any processed data can be converted to a Normal PDF using the Fisher Transform A PDF of virtually any processed data can be converted to a Normal PDF using the Fisher Transform

John Ehlers 26 Fisher Transform A Fisher Transform has no lag – it expands range near the endpoints

John Ehlers 27 Fisherized Channel PDF for Treasury Bonds Fisherized Channel PDF for Treasury Bonds 20 Bar Fisherized Channel over 30 Years Original PDF

John Ehlers 28 Simple Trading System {>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Normalized Channel with Fisher Transform Trading System (c) 2007 John F. Ehlers <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<} Inputs: Length(8), UBound(.5), LBound(-.5); Vars: HH(0), LL(0), FH(0), FL(0), Fisher(0), Count(0), Psn(0); If CurrentBar > Length Then Begin HH = Close; LL = Close; For Count = 0 to Length - 1 Begin If Close[Count] > HH Then HH = Close[Count]; If Close[Count] < LL Then LL = Close[Count]; End; If HH <> LL Then Value1 = 2*((Close - LL) / (HH - LL) -.5); Psn = (Value1 + 2*Value1[1] + Value1[2]) / 4; If Psn >.999 Then Psn =.999; If Psn < Then Psn = -.999; Fisher =.5*Log((1 + Psn) / (1 - Psn)); End; If Fisher Crosses Over UBound Then Sell Short Next Bar on Open; If Fisher Crosses Under LBound Then Buy Next Bar on Open;

John Ehlers 29 Trading System for the life of the contract (from April for the life of the contract (from April 1982) 608 Trades (about once every two weeks)608 Trades (about once every two weeks) 68.9% Profitable Trades68.9% Profitable Trades Profit Factor = 1.75Profit Factor = 1.75

John Ehlers 30 Trading System Results for last 10 for last 10 years 196 Trades (about once every two and a half weeks)196 Trades (about once every two and a half weeks) 63.8% Profitable Trades63.8% Profitable Trades Profit Factor = 1.60Profit Factor = 1.60

John Ehlers 31Conclusions Hurst Coefficient can be used for a global view of the dataHurst Coefficient can be used for a global view of the data Stick with a trading system through its adversityStick with a trading system through its adversity Probability Density Functions of data can vary widely depending on preprocessingProbability Density Functions of data can vary widely depending on preprocessing The Fisher Transform can produce Normal PDF- shaped probability functions regardless of preprocessingThe Fisher Transform can produce Normal PDF- shaped probability functions regardless of preprocessing Simple but elegant trading systems can be developed just from Probability Density Function considerationsSimple but elegant trading systems can be developed just from Probability Density Function considerations

John Ehlers 32 ENGINEERS ARE AS AS ANYONE Above All, Remember

John Ehlers 33 For More Information Trading sites coming in JanuaryTrading sites coming in January – – Meanwhile, try the indicator dashboard atMeanwhile, try the indicator dashboard at –