Sciweavers

158 search results - page 20 / 32
» Prediction of Ordinal Classes Using Regression Trees
Sort
View
ECAI
2004
Springer
14 years 26 days ago
Explaining the Result of a Decision Tree to the End-User
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...
Isabelle Alvarez
ALT
1995
Springer
13 years 11 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara
ESSOS
2009
Springer
14 years 2 months ago
Toward Non-security Failures as a Predictor of Security Faults and Failures
In the search for metrics that can predict the presence of vulnerabilities early in the software life cycle, there may be some benefit to choosing metrics from the non-security rea...
Michael Gegick, Pete Rotella, Laurie Williams
INFORMATICALT
1998
89views more  INFORMATICALT 1998»
13 years 7 months ago
Simply Invertible Matrices and Fast Prediction
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
Valdas Diciunas
NIPS
2004
13 years 8 months ago
Log-concavity Results on Gaussian Process Methods for Supervised and Unsupervised Learning
Log-concavity is an important property in the context of optimization, Laplace approximation, and sampling; Bayesian methods based on Gaussian process priors have become quite pop...
Liam Paninski