Sciweavers

1222 search results - page 122 / 245
» Machine Learning of Temporal Relations
Sort
View
ALT
2003
Springer
15 years 7 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
EUROCOLT
1999
Springer
15 years 2 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
AI
2006
Springer
15 years 1 months ago
Beyond the Bag of Words: A Text Representation for Sentence Selection
Sentence selection shares some but not all the characteristics of Automatic Text Categorization. Therefore some but not all the same techniques should be used. In this paper we stu...
Maria Fernanda Caropreso, Stan Matwin
ICML
2000
IEEE
15 years 10 months ago
Exploiting the Cost (In)sensitivity of Decision Tree Splitting Criteria
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
Chris Drummond, Robert C. Holte
ECML
2007
Springer
15 years 4 months ago
Neighborhood-Based Local Sensitivity
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
Paul N. Bennett