It could be done using the Open Source Integration Node. Extreme Gradient Boosting is not something available from SAS, currently. It is certainly something I hope they add in the near future though.   EDIT:   I feel like pointing out here that the main appeal of XGBoost is it's performance from an engineering standpoint, rather than statistical.  This is what really sets this pacakage apart from the GBM from SAS.     As far as overfitting is concerned, two traditional methods would be reducing the number of iterations as well as adjusting your subsample size. ... View more

data dataset_A; input key:$4.; datalines; AAA BBB CCC DDD ; run; data dataset_B; input key:$4.; infile datalines dlm = ","; datalines; AAa B BB CcC DDD ; run; proc ds2; data hashjoin_dataset(overwrite=yes); dcl package hash h ([key],[key],0,'{select upcase(compress(key)) as key from dataset_b}'); method run(); set dataset_A; key = upcase(compress(key)); if h.find()=0 then output; end; enddata; run; quit; ... View more

* modify key for hash below with view; data v_dataset_B/view=v_dataset_B; set dataset_B; key=compress(upcase(key)); run; data hashjoin_dataset ; if 0 then set v_dataset_B; if _N_ = 1 then do; declare hash T(dataset: 'v_dataset_B'); T.definekey('key'); T.definedata (all:'yes'); T.definedone(); end; set dataset_A; key=compress(upcase(key)); if T.find() = 0; /* join */ drop rc; rc = t.find(); run; ... View more

I believe I had a typo in the code I posted before filename cp '$DATA/deen_hash.txt'; proc groovy classpath=cp; ... quit; options set=classpath "%sysfunc(pathname(cp,f))"; * I had an equal sign between classpath and the value, which should not be there; data _null_; ... run;     The WARNING WARNING: SAS jars do not have a source compatibility guarantee across versions of SAS. Future versions of these jars can change without notice. Can be ignored, it is pointing out the issue you had before, which is that different versions of SAS will have different versions of this Jar file...  ... View more

@Deen   As I noted in the comment for the line that gave you the error:   add sasjar="commons_codec" version="1.7.0.0_SAS_20121211183158"; *version is specific to SAS Installation and may differ from this;   You need to find the correct version number for you installation.   You can find this by browsing your SAS installation     ls -d /path/to/SASHome/SASVersionedJarRepository/9.3/eclipse/plugins/commons_codec*     This should display something like     /path/to/SASHome/SASVersionedJarRepository/9.3/eclipse/plugins/commons_codec_1.3.0.0_SAS_20081023153014/   You want to then modify the proc groovy with the correct version     add sasjar="commons_codec" version="1.3.0.0_SAS_20081023153014";   ... View more

filename groovy temp; proc http method='get' url="http://central.maven.org/maven2/org/codehaus/groovy/groovy-all/2.4.6/groovy-all-2.4.6.jar" out=groovy; run; filename xmlbind temp; proc http method='get' url="http://central.maven.org/maven2/javax/xml/bind/jaxb-api/2.2.12/jaxb-api-2.2.12.jar" out=xmlbind; run; filename cp temp; options set=classpath= "%sysfunc(pathname(cp,f))"; proc groovy classpath=cp; add classpath=groovy; add classpath=xmlbind; add sasjar="commons_codec" version="1.7.0.0_SAS_20121211183158"; *version is specific to SAS Installation and may differ from this; submit parseonly; import javax.xml.bind.DatatypeConverter import java.security.MessageDigest import java.security.NoSuchAlgorithmException import java.util.ArrayList import org.apache.commons.codec.binary.Base64 /** * DeenHash Requirements * * * 1. Hash an input String (ex. "abc123") using SHA-256 algorithm * 2. Concatenate input string + hexDump of step1 result * 3. Hash step2 result using SHA-256 algorithm * a. this marks a single-round * b. print raw step3 result in Base64 encoding * 4. Hash step3 result 999 additional times using SHA-256 algorithm */ public class DeenHash { private String input = "abc123"; private String algorithm = "SHA-256"; protected ArrayList<byte[]> results=new ArrayList(); public DeenHash() {} public DeenHash(String input) { setInput(input); } public DeenHash(String algorithm, String input) throws NoSuchAlgorithmException{ setAlgorithm(algorithm); } public String getInput() { return this.input; } public void setInput(String input) { this.input = input; } public String getAlgorithm() { return this.algorithm; } public void setAlgorithm(String algorithm) throws NoSuchAlgorithmException { MessageDigest.getInstance(algorithm); this.algorithm = algorithm; } private String toHexString(byte[] bytes) { return DatatypeConverter.printHexBinary(bytes); } private String toBase64(byte[] bytes) { Base64 base64 = new Base64(); return new String(base64.encode(bytes)); } private byte[] merryGoRound(byte[] bytes) throws NoSuchAlgorithmException { byte[] step4 = bytes; for (int i=0; i<999; i++) { step4 = doSingleHash(step4); } return step4; } public byte[] doSingleHash(byte[] bytes) throws NoSuchAlgorithmException { MessageDigest md = MessageDigest.getInstance(this.algorithm); md.update(bytes); return md.digest(); } public void doDeenHash() throws NoSuchAlgorithmException { byte[] step1 = doSingleHash(this.input.getBytes()); String step2 = this.input + toHexString(step1).toLowerCase(); byte[] step3 = doSingleHash(step2.getBytes()); this.results.add(step3); byte[] step4 = merryGoRound(step3); this.results.add(step4); } public String getFinalHash() { return toBase64(this.results.get(1)); } public String getInitialHash() { return toBase64(this.results.get(0)); } public void main(String[] args) { if (args.length == 1) { setInput(args[0]); } else if (args.length == 2) { try { setAlgorithm(args[0]); setInput(args[1]); } catch (NoSuchAlgorithmException e) { e.printStackTrace(); } } try { doDeenHash(); System.out.println("Single Round: " + toBase64(this.results.get(0))); System.out.println("Final Round: " + toBase64(this.results.get(1))); } catch (NoSuchAlgorithmException e) { e.printStackTrace(); } } } endsubmit; submit; foo = new DeenHash() foo.main() endsubmit; quit; data foo; input foo $; cards; abc123 ; run; data _null_; dcl javaobj hash('DeenHash'); do until(done); set foo end=done; length one thousand $ 64; hash.callVoidMethod('setInput',strip(foo)); *strip is important; hash.callVoidMethod('doDeenHash'); hash.callStringMethod('getInitialHash',one); hash.callStringMethod('getFinalHash',thousand); put (one thousand) (=/); end; stop; run;     190 endsubmit; NOTE: The SUBMIT command completed. 191 192 submit; 193 foo = new DeenHash() 194 foo.main() 195 endsubmit; Single Round: Pbb2/dJkywFxhuW2O33twGm+Gu67UfoEFupDMUeBnuo= Final Round: aJDhkskZ9OwP1n1akIoOgReHjm+iFJ0ofPt3CNhvFy8= NOTE: The SUBMIT command completed. 196 197 quit; NOTE: PROCEDURE GROOVY used (Total process time): real time 0.14 seconds cpu time 0.01 seconds   215 put (one thousand) (=/); 216 end; 217 stop; 218 run; one=Pbb2/dJkywFxhuW2O33twGm+Gu67UfoEFupDMUeBnuo= thousand=aJDhkskZ9OwP1n1akIoOgReHjm+iFJ0ofPt3CNhvFy8= NOTE: There were 1 observations read from the data set WORK.FOO. NOTE: DATA statement used (Total process time): real time 0.02 seconds cpu time 0.00 seconds ... View more

Okay, turns out the problem is that the last step should read... Hash it 999 more times, for 1000 total... Not 1000 more times... ... View more

You requirements are still missing a component to fully make sense. Most obviously, the two strings you posted here are Base64 encoded, which isn't in the instructions. I can now duplicate the 'single round' value. When does the Base64 encoding applied? Just for display? In between each round? ... View more