Sciweavers

7 search results - page 1 / 2
» Learning Graph Walk Based Similarity Measures for Parsed Tex...
Sort
View
EMNLP
2008
13 years 6 months ago
Learning Graph Walk Based Similarity Measures for Parsed Text
We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between the...
Einat Minkov, William W. Cohen
ACL
1998
13 years 6 months ago
Automatic Retrieval and Clustering of Similar Words
Bootstrapping semantics from text is one of the greatest challenges in natural language learning. We first define a word similarity measure based on the distributional pattern of ...
Dekang Lin
SIGIR
2006
ACM
13 years 11 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
13 years 9 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
ICML
2003
IEEE
14 years 6 months ago
Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...
Xiaojin Zhu, Zoubin Ghahramani, John D. Lafferty