Sciweavers

92 search results - page 2 / 19
» On the Relative Hardness of Clustering Corpora
Sort
View
COLING
2000
13 years 6 months ago
Automatic Extraction of Semantic Relations from Specialized Corpora
In this paper we address the problem of discovering word semantic similarities via statistical processing of text corpora. We propose a knowledge-poor method that exploits the sen...
Aristomenis Thanopoulos, Nikos Fakotakis, George K...
ANLP
1992
89views more  ANLP 1992»
13 years 6 months ago
Computational Lexicons: the Neat Examples and the Odd Exemplars
When implementing computational lexicons it is important to keep in mind the texts that a NLP system must deal with. Words relate to each other in many different, often queer, way...
Roberto Basili, Maria Teresa Pazienza, Paola Velar...
NIPS
2004
13 years 6 months ago
Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes
We propose the hierarchical Dirichlet process (HDP), a nonparametric Bayesian model for clustering problems involving multiple groups of data. Each group of data is modeled with a...
Yee Whye Teh, Michael I. Jordan, Matthew J. Beal, ...
ACL
2006
13 years 6 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
AI
2006
Springer
13 years 5 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth