Latent Maximum Margin Clustering

We present a maximum margin framework that clusters data using latent variables. Using latent representations enables our framework to model unobserved information embedded in the data. We implement our idea by large margin learning, and develop an alternating descent algorithm to effectively solve the resultant non-convex optimization problem. We instantiate our latent maximum margin clustering framework with tag-based video clustering tasks, where each video is represented by a latent tag model describing the presence or absence of video tags. Experimental results obtained on three standard datasets show that the proposed method outperforms non-latent maximum margin clustering as well as conventional clustering approaches.

Authors

• Guang-Tong Zhou Simon Fraser University
• Tian Lan George Washington University
• Arash Vahdat
• Greg Mori

Keywords

No keywords are indexed for this paper.