File(s) not publicly available
MaxMax - a graph-based soft clustering algorithm applied to word sense induction
chapter
posted on 2023-06-08, 12:50 authored by David Richard Hope, Bill KellerThis 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.
History
Publication status
- Published
External DOI
Page range
368-381Event name
Conference on Intelligent Text Processing and Computational Linguistics (CICLING)Event location
University of the Aegean, Samos, GreeceEvent type
conferenceEvent date
March 24–30, 2013Department affiliated with
- Informatics Publications
Full text available
- No
Peer reviewed?
- No
Legacy Posted Date
2013-05-15Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC