cat <<EOF 
#!`which gawk` -f

################################################################
# lifter v0.1 : recursive cliff treatment learner
# Copyright 2006 by tim@menzies.us; GNU gpl v2.0
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; version 2.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc.,51 Franklin Street, Fifth Floor, Boston, 
# MA 02110-1301, USA.
################################################################

#assumes unique class utility

BEGIN {  
		IGNORECASE= 1; 
		FS        = " "; 
		OFS       = ","; 
		Cnum      = "$"; 
		Cskip     = "?";
		Klass     = 0;
		Big       = 32;
		Min       = 4;
		Utils     = "negative,2,neg,2,no,2,f,2,false,2,"\
                    "yes,4,t,4,true,4,positive,4,pos,4";
}
					{ gsub(/[ \t{}]/,"") }
NR==1               { Csv = FILENAME ~ /\.csv$/ }
Csv       		    { NR==1 ? readCsvNames() :  beginData() }
	                { sub(/[\#\%].*/,""); 
/^$/                { next }
/@data/             { beginData() }
/@attribute/        { push1(Names,$2);
					  if ($3 ~ /[number|integer|real|continuous]/) {
						Number[Names[0]]=1
					  } else { Utils = weightedRange();} 
                    }
/@relation/,/@data/ { next } 

Data { $Klass = Klass in Number ? $Klass :  U[$Klass] 
       SumClass += $Nclass;
	   for(I=1;I<=NF;I++) {
	      if (I  == Nclass   ) continue;
		  if ($I ~  Cskip) continue;	
		  if (I in Number)  {
			  $I = $I + rand()/(10^Big);
			  push(Nums,I,$I);
			  Ssalc[I,$I]=$Nclass;
		  } else {
			  F[$Nclass,I,$I]++ }}
}
END { 
	for(I in Numbers) {
		sort(Nums,I) ;
		lift1(SumClass,Nums,I,Out)
	}
}
function beginData(  tmp,i,n)    { 
	    if(!Nclass)
			Nclass = Csv ? NF : Names[0]
		srand(Seed ? Seed : 1) 
		Data = 1; 
		FS   = ","; 
		n    = split(Utils,tmp,",");
		for(i=1;i<=NF;i=i+2) 
			U[tmp[i]]=tmp[i+1]
} 
function weightedRange(  tmp,n,i,str,sep) {
	$1=$2="";
	n=split($0,tmp,",");
	for(i=1;i<=NF;i++) {
		str = str sep tmp[i] "," 2^n;
		sep = ",";
		n++
	}
	return str;
}
function readCsvNames(   i) { 
	for(i=1;i<=NF;i++) {
		push1(Names,$i) 
		Number[Data[i,0]] = $i ~ Cnum}
}
function push(a,k,v, i) { i= ++a[k,0]; a[k,i]=v; return v    }
function push1(a,v,  i) { i= ++a[0];   a[i]=v;   return v    }

function sort(a,k,   i,m,n,s) {
  m = a[k,0];
  for(i=1; i<=m; i++) s[i] = a[k,i] 
  n=asort(s);
  for(i=1;i<=n;i++)   a[k,i] = s[i];
  return n;
}
function  lift1(total,a,k,out, m,i,left,right,tmp,best,snap) {
	m=a[k,0] - Min;
	for(i=1;i<=m;i++) {
		left += a[k,i] 
	    right = total - left;
		tmp   = left / right 
	    if (tmp > best) {
			out["at"]    = a[k,i]; 
			out["ratio"] = tmp;
			best = tmp} 
	}
}

# requirez(list/saya.awk)