Sciweavers

1658 search results - page 40 / 332
» Learning Unknown Graphs
Sort
View
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 2 months ago
Near-Optimal Bayesian Active Learning with Noisy Observations
We tackle the fundamental problem of Bayesian active learning with noise, where we need to adaptively select from a number of expensive tests in order to identify an unknown hypot...
Daniel Golovin, Andreas Krause, Debajyoti Ray
115
Voted
ICML
2006
IEEE
16 years 2 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
JUCS
2008
147views more  JUCS 2008»
15 years 1 months ago
Authoring Courses with Rich Adaptive Sequencing for IMS Learning Design
: This paper describes the process of translating an adaptive sequencing strategy designed using Sequencing Graphs to the semantics of IMS Learning Design. The relevance of this co...
Sergio Gutiérrez Santos, Abelardo Pardo, Ca...
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 8 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
COLT
2005
Springer
15 years 7 months ago
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...