First if this book is Randall Matignon book then this book is old and based on Miner v4. It still may be helpful to understand more about Miner, but i am not sure if it is the best resource to learn.     Tip: Guidelines for Choosing a Clustering Method in the Cluster Node ,  this articale give good explanation of the automatic selection process.    It is not k-means and hierarchical clustering. What happen is based on the number of seeds (50 by default) training data are distributed to the closest seed. Then the means of these intial clusters are calculated. After that the hierarchical clustering consolidate these clusters and within the CCC is calculated. Finally the final number of cluster provide the K in K-means and the clusters are obtained using a k-means algorithm.   So yes, the number of seeds affect the final number of cluster in the automatic selection process. ... View more

Use the FLOOR function to round down to the next integer.   data a; input have; need=floor(have); datalines; 1.2 0.1 10 123.456 34 5.1111 7.68 10.98 -3.1 -19.0 -4.8 ; proc print; run;   ... View more

The class statement defines which variables are to be treated as categorical variables in the model statement. And you did not add the variable year in the model statment, after the Class statment.   So try:   proc glm; class year; model A=B C year/ solution noint; run; quit;     Then you will get the  individual year fixed effects estimates. And you should get no difference estimates on B and C for the two procedures ... View more

proc sql; CREATE TABLE except AS select * from WORK.IDENTIFY_INACTIVE_MLP_YESTERDAY except     select * from WORK.MLP_RECORDS_2_ADD_UPDATE;    ... View more

The hash object keeps the multiple values in a list that is associated with the key. This list can be traversed and manipulated by using several methods such as HAS_NEXT or FIND_NEXT.   See the first example in Better Hashing in SAS® 9.2       data _null_; length key 8 data $ 8; if (_n_ = 1) then do; declare hash myhash(dataset: "table",multidata: "y"); rc = myhash.definekey('key'); rc = myhash.definedata('data'); myhash.definedone(); end; do key = '531', '620', '908', '143'; rc = myhash.find(); if (rc = 0) then do; put key= @15 data=; myhash.has_next(result: r); do while(r ne 0); myhash.find_next(); put key= @15 data=  @25 '(dup)'; myhash.has_next(result: r); end; end; end; run; ... View more