557 search results - page 58 / 112 » Learning programs from noisy data |
133
Voted
JMLR
2012
13 years 5 months ago
2012
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for...
158
Voted
ESOP
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
116
click to vote
COLT
1992
Springer
15 years 6 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
108
Voted
KDD
1997
ACM
15 years 6 months ago
1997
ACM
In this paper, we describe the JAM system, a distributed, scalable and portable agent-based data mining system that employs a general approach to scaling data mining applications ...
133
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...