Java code for hierarchical microclustering
<p>can anyone provide me the java working code for the following algorithm..??</p>

<p>Input: Transaction dataset D,</p>

<p>A set of n closed frequent patterns, P = {p1,p2, ......pn}</p>

<p>Threshold of distance, gamma</p>

<p>Output: A set of patterns, O= {o1,o2,.....,on}</p>

<ol>
<li>initialize n clusters Ci, each as
a closed frequent pattern; </li>
<li>compute the Jaccard Distance dij
among {p1,p2, ......pn}; </li>
<li>set the
current minimal distance d = min(dij
); </li>
<li>while (d &lt; gamma) </li>
<li>select
dst where (s; t) = argmin(ij)dij ;</li>
<li>merge clusters Cs and Ct into a
new cluster Cu;</li>
<li>foreach Cv != Cu</li>
<li>compute duv = max(dab) where pa
belongs to Cu; pb belongs Cv;</li>
<li>foreach Cu; </li>
<li>foreach pa belonging
to Cu;</li>
<li>compute da' = avg(dab)
where pb belongs to Cu;</li>
<li>add p®
into P', where a = argmini(  dii);</li>
<li>return</li>
</ol>
