92 search results - page 1 / 19 » On the Relative Hardness of Clustering Corpora |
TSD
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Clustering is often considered the most important unsupervised learning problem and several clustering algorithms have been proposed over the years. Many of these algorit...
DEXAW
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—In this work, we investigate the relative hardness of shorttext corpora in clustering problems and how this hardness relates to traditional similarity measures. Our appr...
TSD
2001
Springer
13 years 9 months ago
2001
Springer
The paper deals with the linguistic problem of fully automatic grouping of semantically related words. We discuss the measures of semantic relatedness of basic word forms and descr...
EMNLP
2008
13 years 6 months ago
2008
Relationship discovery is the task of identifying salient relationships between named entities in text. We propose novel approaches for two sub-tasks of the problem: identifying t...
ACL
2004
13 years 6 months ago
2004
Discovering the significant relations embedded in documents would be very useful not only for information retrieval but also for question answering and summarization. Prior method...