A Linear-RBF Multikernel SVM to Classify Big Text Corpora

Algorithm 2

Optimal hierarchy level algorithm (pseudocode).

  Input: LL is the best agglomeration

  Result: Optimal hierarchy level

(01) optimalLevel ← ;

(02) foreach   level l in LL do

(03)  counter ← 0;

(04)  foreach   cluster c in l   do

(05)   test ← MultiLillieforsTest ();

(06)   if test is true then

(07)    counter ← +1;

(08)  aux ← NumClusters (l);

(09)  if aux = counter then

(10)   optimalLevel ←l;

(11)  else

(12)   break; //Breaks outer loop

(13) return optimalLevel