Sciweavers

209 search results - page 17 / 42
» Analyzing the Errors of Unsupervised Learning
Sort
View
STACS
1999
Springer
15 years 1 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
106
Voted
PAMI
2010
170views more  PAMI 2010»
14 years 8 months ago
On the Decoding Process in Ternary Error-Correcting Output Codes
—A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-Correcting Output Codes (ECOC) represent a successfu...
Sergio Escalera, Oriol Pujol, Petia Radeva
OSDI
2008
ACM
15 years 10 months ago
Digging for Data Structures
Because writing computer programs is hard, computer programmers are taught to use encapsulation and modularity to hide complexity and reduce the potential for errors. Their progra...
Anthony Cozzie, Frank Stratton, Hui Xue, Samuel T....
SPEECH
1998
118views more  SPEECH 1998»
14 years 9 months ago
Dimensionality reduction of electropalatographic data using latent variable models
We consider the problem of obtaining a reduced dimension representation of electropalatographic (EPG) data. An unsupervised learning approach based on latent variable modelling is...
Miguel Á. Carreira-Perpiñán, ...
EMNLP
2009
14 years 7 months ago
Simple Coreference Resolution with Rich Syntactic and Semantic Features
Coreference systems are driven by syntactic, semantic, and discourse constraints. We present a simple approach which completely modularizes these three aspects. In contrast to muc...
Aria Haghighi, Dan Klein