Sciweavers

481 search results - page 62 / 97
» Learning relational probability trees
Sort
View
EDM
2008
104views Data Mining» more  EDM 2008»
13 years 9 months ago
Data-driven modelling of students' interactions in an ILE
This paper presents the development of two related machine-learned models which predict (a) whether a student can answer correctly questions in an ILE without requesting help and (...
Manolis Mavrikis
ALT
2007
Springer
13 years 11 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
NIPS
2003
13 years 9 months ago
Wormholes Improve Contrastive Divergence
In models that define probabilities via energies, maximum likelihood learning typically involves using Markov Chain Monte Carlo to sample from the model’s distribution. If the ...
Geoffrey E. Hinton, Max Welling, Andriy Mnih
ICML
2010
IEEE
13 years 8 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
On the Implementation of the Probabilistic Logic Programming Language ProbLog
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have...
Angelika Kimmig, Bart Demoen, Luc De Raedt, V&iacu...