Unsupervised clustering using hyperclique pattern constraints

Yuchou Chang, Dah-Jye Lee, James K. Archibald, Yi Hong · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · 2008

A novel unsupervised clustering algorithm called Hyperclique Pattern-KMEANS (HP-KMEANS) is presented. Considering recent success in semi-supervised clustering using pair-wise constraints, an unsupervised clustering method that selects constraints automatically based on Hyperclique patterns is proposed. The COP-KMEANS framework is then adopted to cluster instances of data sets into corresponding groups. Experiments demonstrate promising results compared to classical unsupervised k-means clustering.

Read the paper · More papers on PaperTik