Sciweavers

9886 search results - page 1535 / 1978
» Learning Compressible Models
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Task Driven Coreference Resolution for Relation Extraction
Abstract. This paper presents the extension of an existing mimimally supervised rule acquisition method for relation extraction by coreference resolution (CR). To this end, a novel...
Feiyu Xu, Hans Uszkoreit, Hong Li
ICAI
2008
15 years 8 months ago
Nonrestrictive Concept-Acquisition by Representational Redescription
coarse procedures or very abstract frames from the point of view of algorithm, because some crucial issues like the representation, evolution, storage, and learning process of conc...
Hui Wei, Yan Chen
ACL
2006
15 years 8 months ago
Morphological Richness Offsets Resource Demand - Experiences in Constructing a POS Tagger for Hindi
In this paper we report our work on building a POS tagger for a morphologically rich language- Hindi. The theme of the research is to vindicate the stand that- if morphology is st...
Smriti Singh, Kuhoo Gupta, Manish Shrivastava, Pus...
NIPS
2004
15 years 8 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
UAI
2003
15 years 8 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
« Prev « First page 1535 / 1978 Last » Next »