Sciweavers

154 search results - page 14 / 31
» Maximum Entropy Model Learning of the Translation Rules
Sort
View
CVPR
2000
IEEE
15 years 11 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
NIPS
2000
14 years 10 months ago
An Information Maximization Approach to Overcomplete and Recurrent Representations
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
Oren Shriki, Haim Sompolinsky, Daniel D. Lee
COLING
2000
14 years 10 months ago
Application of Analogical Modelling to Example Based Machine Translation
This paper describes a self-modelling, incremental algorithm for learning translation rules from existing bilingual corpora. The notions of supracontext and subcontext are extende...
Christos Malavazosi, Stelios Piperidis
ICML
2001
IEEE
15 years 10 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
TCBB
2010
176views more  TCBB 2010»
14 years 7 months ago
Feature Selection for Gene Expression Using Model-Based Entropy
—Gene expression data usually contain a large number of genes, but a small number of samples. Feature selection for gene expression data aims at finding a set of genes that best...
Shenghuo Zhu, Dingding Wang, Kai Yu, Tao Li, Yihon...