新規登録 | ログイン | FAQ

[?]

CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Recent | Unread | Search | Authors | Tags | Export

An analytic solution to discrete Bayesian reinforcement learning

by: Pascal Poupart, Nikos Vlassis, Jesse Hoey, Kevin Regan

(2006), pp. 697-704.

View FullText article

ACM, DOI

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

vlachmore, bsilverthorn

Find related articles with these CiteULike tags

bayesian, learning, reinforcement, reinforcement_learning

BibTeX record

RIS record

vlachmore's tags

All tags in vlachmore's library

Filter:

ace active active_learning adaboost adaptation agglomerative agreement algorithm algorithms allocation amibguity analysis anaphora annotation argument aso average bag-of-concepts based bayes bayesian b-cubed belief bigrams binomial biocreative bioinformatics bionlp blocked boosting bootstrapping bottleneck buffet by carlo categorization chain chunking church class classification classifier clustering cobweb codes collapsed combination comlex committee comparison complete-link component compositional compound concept concept_discovery conditional confidence conformal constrained_clustering constraints context contraints convergence conway cooccurrence coreference corpora corpus correcting correspondence cost co-testing co-training counts crf crfs criterion curation datasets dependencies dependency detection dictionaries dimensionality dirichlet disambiguation discrete discriminative distance distribution distributional divergence document domain ecoc eigenvalues em english ensemble entity entrez entropy error estimation evaluation event expectation expectation-maximization experiments exponential extraction factorization feature feedback fields filtering filters fisher flybase flyslip frame frames frequency functions gamma gaussian gene gene_ontology generalized generation generative geneways german gibbs gibs grammar grammatical graph graphical graph_kernel guidelines harmonic heat hedge hellinger hidden hierarchical hmm hpsg ibp identifier index indexing indian induction inference infinite information information_gain interaction inter-annotator interpretation inverse iob iobew kalman kdd kernel kernels kl-divergence k-means knn labels language laplacian large laten latent lda learning lexicon likelihood lingpipe linguistic logarithmic logistic loopy lop lsi machine machines mallet markov matrix maximization maximum maxwell mcmc measure membership methods metric metrics mining mira mixture model modelling models monte multiclass multinomial multinomials multiple multi-task muticlass mutual_information naive name named ncbi nearest neighbors ner nlp noise non-negative non-parametric normalization noun on-line ontology opinion output overlap parameter parse parser parsing partial particle part-of-speech pca perceptron pitman poisson polysemous pool positive ppi predicate prediction principal prior priors probabilistic probability process processes propaagation proper protein protein-protein qbc query query_by_committee rand random ranking rasp rcv1 recognition reduction regression reinforcement relation relational relationships resolution retrieval reusability reuters rules sampling scheme scixml seed segmentation selection selective semantic semantics semi-supervised sense sentiment sequence shallow shared similarity single-link sketch skip-chain smoothing soft softtfidf software space sparse spectral spectral_clustering speculative speech statistical stick-breaking stopping string string_kernel structural structure subcategorization summarization supervised support svm svms switching syntactic tagging task term text timed topic transductive transformation-based tree tutorial uncertainty unigrams unlabelled unsupervised user variable variable-length variational variational_inference vector verb views v-measure walks web weighting word wordnet wsd xml yor