Sciweavers

1419 search results - page 134 / 284
» Approximation Methods for Supervised Learning
Sort
View
105
Voted
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
15 years 4 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
135
Voted
ECAI
2004
Springer
15 years 4 months ago
Avoiding Data Overfitting in Scientific Discovery: Experiments in Functional Genomics
Functional genomics is a typical scientific discovery domain characterized by a very large number of attributes (genes) relative to the number of examples (observations). The dang...
Dragan Gamberger, Nada Lavrac
NIPS
2007
15 years 2 months ago
Hierarchical Penalization
Hierarchical penalization is a generic framework for incorporating prior information in the fitting of statistical models, when the explicative variables are organized in a hiera...
Marie Szafranski, Yves Grandvalet, Pierre Morizet-...
105
Voted
EMNLP
2004
15 years 2 months ago
Trained Named Entity Recognition using Distributional Clusters
This work applies boosted wrapper induction (BWI), a machine learning algorithm for information extraction from semi-structured documents, to the problem of named entity recogniti...
Dayne Freitag
121
Voted
COLING
2002
15 years 13 days ago
A Maximum Entropy-based Word Sense Disambiguation System
In this paper, a supervised learning system of word sense disambiguation is presented. It is based on conditional maximum entropy models. This system acquires the linguistic knowl...
Armando Suárez, Manuel Palomar