Sciweavers

940 search results - page 27 / 188
» Learning Word Representations from Relational Graphs
Sort
View
132
Voted
SDM
2010
SIAM
259views Data Mining» more  SDM 2010»
15 years 5 months ago
Semi-supervised Bio-named Entity Recognition with Word-Codebook Learning
We describe a novel semi-supervised method called WordCodebook Learning (WCL), and apply it to the task of bionamed entity recognition (bioNER). Typical bioNER systems can be seen...
Pavel P. Kuksa, Yanjun Qi
115
Voted
IJON
2010
94views more  IJON 2010»
15 years 2 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix
170
Voted
EMNLP
2011
14 years 3 months ago
Relation Extraction with Relation Topics
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
Chang Wang, James Fan, Aditya Kalyanpur, David Gon...
134
Voted
ICIP
2004
IEEE
16 years 5 months ago
Estimating facial pose from a sparse representation
We present an approach to estimate the poses of human heads in natural scenes. The essential features for estimating the head pose are the positions of the prominent facial featur...
Hankyu Moon, M. L. Miller
PR
2008
206views more  PR 2008»
15 years 3 months ago
A study of graph spectra for comparing graphs and trees
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
Richard C. Wilson, Ping Zhu