An improved algorithm for semantic clustering

Authors:
Gabriel Castillo;Gerardo Sierra;John McNaught
Affiliations:
Instituto de Ingeniería, UNAM;Instituto de Ingeniería, UNAM;Department of Computation, UMIST
Venue:
ISICT '03 Proceedings of the 1st international symposium on Information and communication technologies
Year:
2003

Citing 2
Cited 1

The String-to-String Correction Problem

Journal of the ACM (JACM)
Modern Information Retrieval

Modern Information Retrieval

LRD: latent relation discovery for vector space expansion and information retrieval

WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sierra & McNaught (2000) proposed a clustering algorithm based on analogy. It takes as input pairs of definitions sharing the same term headword, in the same domain but from different sources, compares these definitions and identifies couples of words in the same extended semantic context. These couples are then grouped to yield semantically-related clusters. Here, we further evaluate the clustering algorithm, and develop an improved version whose results are also evaluated.