Skip to main content

Trend Removal Using the Hodrick-Prescott (HP) Filter

Hodrick-Prescott filter (see Hodrick and Prescott (1997)) is a popular tool in macroeconomics for fitting smooth trend to time series. In SAS, we can use PROC UCM to realize the HP filter. The dataset considered in this example consists of quarterly real GDP for the United States from 1947-2016 (billions of chained 2009 dollars, seasonally adjusted annual rate). The data can be download from this link https://fred.stlouisfed.org/series/GDPC1 

%macro hp(input= ,date= ,int= ,var= ,par= ,out= );
proc ucm data=&input;
id &date interval=∫
model &var;
irregular plot=smooth;
level var=0 noest plot=smooth;
slope var=&par noest;
estimate PROFILE;
forecast plot=(decomp) outfor=&out;
run;
%mend;


%hp(input=gdp,date=year,int=qtr,var=gdp,par=0.000625,out=result);

 I use SAS MACROS to define a function for HP filter. "input" is the data file you use, "date" is the variable for time, "int" is the time interval which could be hour, day, month, qtr, year, "var" is the variable for hp filter, "par" is a multiple which depends on the frequency of the series (1/14400 for monthly data, 1/1600 = 0.000625 for quarterly data, range from 1/400 = 0.0025 to 1/7 = 0.15 for annual data), "out" is the name of data file to record the output. The following two graphs are the detrended series and trend series.




Labels:

Comments

  1. sharmiApril 17, 2018 at 1:57 AM

    Thanks for sharing and explaining me in detail about the latest technology. Hope waiting for more posts like this.
    SAS Training in Chennai
    SAS Course in Chennai

    ReplyDelete
  2. divyaApril 23, 2018 at 5:21 AM

    Your post about technology was very helpful to me. Very clear step-by-step instructions. I appreciate your hard work and thanks for sharing. Thanks a lot for explaining practically. Fantastic Post! Get more information SAS Training in Chennai|SAS Course in Chennai|Spring Training in Chennai

    ReplyDelete
  3. Vicky RamAugust 17, 2018 at 10:32 PM

    Great Post. Keep sharing such kind of worthy information


    SAS Training Institutes in Chennai

    SAS Institute in Chennai

    ReplyDelete

Post a Comment

Popular posts from this blog

Weighted Percentile in Python Pandas

Unfortunately, there is no weighted built-in functions in Python. If we want to get some weighted percentiles by Python, one possible method is to extend the list of data, letting the values of weight as the numbers of elements, which is discussed in a Stack Overflow poster . For example, if we have a data like, score   weight 5          2 4          3 2          4 8          1 we firstly extend the list of scores to {5, 5, 4, 4, 4, 2, 2, 2, 2, 8}, and then find the percentiles such as 10% or 50% percentile. The limitations of this method are, (1) weight must be integers; (2) values of weight cannot be very large. What if we want to calculate the weighted percentiles of a large dataset with very large non-integer weights? In this article, I want to show you an alternative method, under Python pandas. step1: given percentile q, (0<=q<=1), calculate p = q * sum of weights; step2: sort the data according the column we want to calculate the weighted percentile thereof;
2 comments
Read more

Rcpp Example: Partition Based Selection Algorithm

In this post, I'm going to take a Rcpp example that call a C++ function to find kth smallest element from an array. A partition-based selection algorithm could be used for implementation. A most basic partition-based selection algorithm, quickselect , is able to achieve linear performance to find the kth element in an unordered list. Quickselect is a variant of quicksort , both of which choose a pivot and then partitions the data by it. The procedure of quickselect is to firstly move all elements smaller than the pivot to the left and what greater than the pivot the the right by exchanging the location of them, given a pivot such as the last element in the list; and then to move the elements in the left or right sublist again according to a new pivot until getting exact kth elements. The difference from quicksort is that quickselect only need to recurses on one side where the desired kth element is, instead of recursing on both sides of the partition which is what quicksort
Post a Comment
Read more