Sciweavers

329 search results - page 24 / 66
» Probably Approximately Correct Learning
Sort
View
121
Voted
IQ
2003
15 years 4 months ago
ClueMaker: A Language for Approximate Record Matching
We introduce ClueMaker, the first language designed specifically for approximate record matching. Clues written in ClueMaker predict whether two records denote the same thing based...
Martin Buechi, Andrew Borthwick, Adam Winkel, Arth...
121
Voted
ATAL
2005
Springer
15 years 8 months ago
Approximating state estimation in multiagent settings using particle filters
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
Prashant Doshi, Piotr J. Gmytrasiewicz
130
Voted
BMCBI
2010
117views more  BMCBI 2010»
15 years 2 months ago
New decoding algorithms for Hidden Markov Models using distance measures on labellings
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
Daniel G. Brown 0001, Jakub Truszkowski
130
Voted
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 3 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
120
Voted
ICML
2005
IEEE
16 years 3 months ago
Finite time bounds for sampling based fitted value iteration
In this paper we consider sampling based fitted value iteration for discounted, large (possibly infinite) state space, finite action Markovian Decision Problems where only a gener...
Csaba Szepesvári, Rémi Munos