Sciweavers

180 search results - page 8 / 36
» Unsupervised Relation Disambiguation Using Spectral Clusteri...
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 7 months ago
Performance Analysis of Spectral Clustering on Compressed, Incomplete and Inaccurate Measurements
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
Blake Hunter, Thomas Strohmer
AAAI
1992
13 years 9 months ago
Learning to Disambiguate Relative Pronouns
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
Claire Cardie
SIGIR
2005
ACM
14 years 1 months ago
Noun sense induction using web search results
This paper presents an algorithm for unsupervised noun sense induction, based on clustering of Web search results. The algorithm does not utilize labeled training instances or any...
Goldee Udani, Shachi Dave, Anthony Davis, Tim Sibl...
WWW
2010
ACM
14 years 2 months ago
Relational duality: unsupervised extraction of semantic relations between entities on the web
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
TIT
2008
224views more  TIT 2008»
13 years 7 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang