Integrating the Supervised Information into Unsupervised Learning

Algorithm 1

𝑃𝑎𝑖𝑟𝑆ℎ𝑜𝑟𝑡𝐷(𝑠,𝑡)

(1)  𝐷𝑠[1∶𝑁]=∞; 𝐷𝑡[1∶𝑁]=−∞; 𝑠𝐿𝑒𝑓𝑡=𝑋; 𝑡𝐿𝑒𝑓𝑡=𝑋;

(2)  while (𝑁𝑜𝑡𝐸𝑚𝑝𝑡𝑦(𝑠𝐿𝑒𝑓𝑡))

(3)   {𝑢=min_{𝑗∈𝑠𝐿𝑒𝑓𝑡}{𝐷𝑠(𝑗)}; 𝑠𝐿𝑒𝑓𝑡=𝑠𝐿𝑒𝑓𝑡−{𝑢};

(4)     for (𝑖=1; 𝑖<=𝑁; 𝑖++)

(5)     if (𝐷𝑠(𝑖)>𝐷𝑠(𝑢)+𝑊(𝑢,𝑖))

(6)       𝐷𝑠(𝑖)=𝐷𝑠(𝑢)+𝑊(𝑢,𝑖);}

(7)  while (𝑁𝑜𝑡𝐸𝑚𝑝𝑡𝑦(𝑡𝐿𝑒𝑓𝑡))

(8)   {𝑢=max_{𝑗∈𝑡𝐿𝑒𝑓𝑡}{𝐷𝑡(𝑗)}; 𝑡𝐿𝑒𝑓𝑡=𝑡𝐿𝑒𝑓𝑡−{𝑢};

(9)     for (𝑖=1; 𝑖≤𝑁;𝑖++)

(10)    if (𝐷𝑡(𝑖)<𝐷𝑡(𝑢)−𝑊(𝑖,𝑢))

(11)      𝐷𝑡(𝑖)=𝐷𝑡(𝑢)−𝑊(𝑖,𝑢);}

(12) Fill 𝐷𝑠 into 𝑆ℎ𝑜𝑟𝑡𝐷's 𝑠^𝑡ℎ row and 𝑠^𝑡ℎ column;

(13) Fill 𝐷𝑡 into 𝑆ℎ𝑜𝑟𝑡𝐷's 𝑡^𝑡ℎ row and 𝑡^𝑡ℎ column.