A quasi-Bayesian perspective to online clustering

DOI10.1214/18-EJS1479zbMath1404.62068arXiv1602.00522OpenAlexW3098553720WikidataQ129210066 ScholiaQ129210066MaRDI QIDQ1786586

Le Li, Benjamin Guedj, Sébastien Loustau

Publication date: 24 September 2018

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.00522

zbMATH Keywords

reversible jump Markov chain Monte Carloonline clusteringRJMCMCBayesian on-line clusteringminimax regret boundsPACBOprobability approximately correctquasi-Bayesian learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Bayesian inference (62F15) Minimax procedures in statistical decision theory (62C20) Monte Carlo methods (65C05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

PACBO

Uses Software

• Unnamed Item
• CAPUSHE
• bridgesampling
• rjmcmc
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating the Number of Clusters in a Data Set Via the Gap Statistic
• Optimal learning with Bernstein Online Aggregation
• Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
• Sparse regression learning by aggregation and Langevin Monte-Carlo
• Mirror averaging with sparsity priors
• On Bayesian model and variable selection using MCMC
• On the number of groups in clustering
• Exponentiated gradient versus gradient descent for linear predictors
• Slope heuristics: overview and implementation
• Harris recurrence of Metropolis-within-Gibbs and trans-dimensional Markov chains
• Aggregation by exponential weighting, sharp PAC-Bayesian bounds and sparsity
• I-divergence geometry of probability distributions and minimization problems
• The weighted majority algorithm
• PAC-Bayesian high dimensional bipartite ranking
• An oracle inequality for quasi-Bayesian nonnegative matrix factorization
• Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.
• PAC-Bayesian estimation and prediction in sparse additive models
• PAC-Bayesian bounds for sparse regression estimation with exponential weights
• Some PAC-Bayesian theorems
• Analysis of two gradient-based algorithms for on-line regression
• Fast learning rates in statistical inference through aggregation
• PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
• A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering
• Finding Groups in Data
• How to use expert advice
• The minimax distortion redundancy in empirical quantizer design
• Multivariate T-Distributions and Their Applications
• Competitive On-line Statistics
• An MCMC model search algorithm for regression problems
• An Algorithm for Online K-Means Clustering
• Sparse single-index model
• Aggregation by Exponential Weighting and Sharp Oracle Inequalities
• Prediction, Learning, and Games
• Learning Theory
• Relative loss bounds for on-line density estimation with the exponential family of distributions

This page was built for publication: A quasi-Bayesian perspective to online clustering