MaxMax: a graph-based soft clustering algorithm applied to word sense induction

  • Authors:
  • David Hope;Bill Keller

  • Affiliations:
  • Cognitive and Language Processing Systems Group, University of Sussex, Brighton, Sussex, UK;Cognitive and Language Processing Systems Group, University of Sussex, Brighton, Sussex, UK

  • Venue:
  • CICLing'13 Proceedings of the 14th international conference on Computational Linguistics and Intelligent Text Processing - Volume Part I
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a linear time graph-based soft clustering algorithm. The algorithm applies a simple idea: given a graph, vertex pairs are assigned to the same cluster if either vertex has maximal affinity to the other. Clusters of varying size, shape, and density are found automatically making the algorithm suited to tasks such Word Sense Induction (WSI), where the number of classes is unknown and where class distributions may be skewed. The algorithm is applied to two WSI tasks, obtaining results comparable with those of systems adopting existing, state-of-the-art methods.