Local-Global Graph Clustering with Applications in Sense and Frame Induction
We present Watset, a new meta-algorithm for fuzzy graph clustering. This algorithm creates an intermediate representation of the input graph that naturally reflects the "ambiguity" of its nodes. It uses hard clustering to discover clusters in this "disambiguated" intermediate graph. After outlining the approach and analyzing its computational complexity, we demonstrate that Watset shows excellent results in two applications: unsupervised synset induction from a synonymy graph and unsupervised semantic frame induction from dependency triples. The presented algorithm is generic and can be also applied to other networks of linguistic data.
READ FULL TEXT