Skip to yearly menu bar Skip to main content


Poster

Overlapping Clustering Models, and One (class) SVM to Bind Them All

Xueyu Mao · Purnamrita Sarkar · Deepayan Chakrabarti

Room 517 AB #114

Keywords: [ Clustering ] [ Large Deviations and Asymptotic Analysis ] [ Frequentist Statistics ] [ Network Analysis ]


Abstract:

People belong to multiple communities, words belong to multiple topics, and books cover multiple genres; overlapping clusters are commonplace. Many existing overlapping clustering methods model each person (or word, or book) as a non-negative weighted combination of "exemplars" who belong solely to one community, with some small noise. Geometrically, each person is a point on a cone whose corners are these exemplars. This basic form encompasses the widely used Mixed Membership Stochastic Blockmodel of networks and its degree-corrected variants, as well as topic models such as LDA. We show that a simple one-class SVM yields provably consistent parameter inference for all such models, and scales to large datasets. Experimental results on several simulated and real datasets show our algorithm (called SVM-cone) is both accurate and scalable.

Live content is unavailable. Log in and register to view live content