Sciweavers

3636 search results - page 503 / 728
» Crafting Papers on Machine Learning
Sort
View
ML
2008
ACM
15 years 5 months ago
Unrestricted pure call-by-value recursion
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...
Johan Nordlander, Magnus Carlsson, Andy Gill
ML
2008
ACM
15 years 5 months ago
Discovering significant patterns
Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due...
Geoffrey I. Webb
ML
2008
ACM
162views Machine Learning» more  ML 2008»
15 years 5 months ago
Incorporating prior knowledge in support vector regression
This paper explores the addition of constraints to the linear programming formulation of the support vector regression problem for the incorporation of prior knowledge. Equality an...
Fabien Lauer, Gérard Bloch
KAIS
2006
121views more  KAIS 2006»
15 years 5 months ago
Using discriminant analysis for multi-class classification: an experimental investigation
Abstract. Many supervised machine learning tasks can be cast as multi-class classification problems. Support vector machines (SVMs) excel at binary classification problems, but the...
Tao Li, Shenghuo Zhu, Mitsunori Ogihara
ML
2006
ACM
122views Machine Learning» more  ML 2006»
15 years 5 months ago
PRL: A probabilistic relational language
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Lise Getoor, John Grant