paper-with-me

Papers

Sparse Bayesian Unsupervised Learning

2014-01-30 · Stephane Gaiffas, Bertrand Michel

This paper is about variable selection, clustering and estimation in an unsupervised high-dimensional setting. Our approach is based on fitting constrained Gaussian mixture models, where we learn the number of clusters $K$ and the set of relevant variables $S$ using a generalized Bayesian posterior with a sparsity inducing prior. We prove a sparsity oracle inequality which shows that this procedure selects the optimal parameters $K$ and $S$. This procedure is implemented using a Metropolis-Hastings algorithm, based on a clustering-oriented greedy proposal, which makes the convergence to the posterior very fast.

📄 PDF Abstract BibTeX arXiv:1401.8017

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringVariable Selection

Similar Papers 제목 키워드 기반

E-commerce Anomaly Detection: A Bayesian Semi-Supervised Tensor Decomposition Approach using Natural Gradients

2018-04-11 · Anil R. Yelundur, Srinivasan H. Sengamedu, Bamdev Mishra

Anomaly Detection has several important applications. In this paper, our focus is on detecting anomalies in seller-reviewer data using tensor decomposition. While tensor-decomposition is mostly unsupervised, we formulate…

Anomaly DetectionData AugmentationTensor Decomposition

Bayesian Variable Selection for Globally Sparse Probabilistic PCA

2016-05-19 · Charles Bouveyron, Pierre Latouche, Pierre-Alexandre Mattei

Sparse versions of principal component analysis (PCA) have imposed themselves as simple, yet powerful ways of selecting relevant features of high-dimensional data in an unsupervised manner. However, when several sparse p…

Model SelectionVariable Selection

Co-Sparse Textural Similarity for Image Segmentation

2013-12-17 · Claudia Nieuwenhuis, Daniel Cremers, Simon Hawe, Martin Kleinsteuber

We propose an algorithm for segmenting natural images based on texture and color information, which leverages the co-sparse analysis model for image segmentation within a convex multilabel optimization framework. As a ke…

Image SegmentationInteractive SegmentationSegmentationSemantic Segmentation

Supervised Dictionary Learning by a Variational Bayesian Group Sparse Nonnegative Matrix Factorization

2014-05-27 · Ivan Ivek

Nonnegative matrix factorization (NMF) with group sparsity constraints is formulated as a probabilistic graphical model and, assuming some observed data have been generated by the model, a feasible variational Bayesian a…

ClassificationDictionary LearningFace RecognitionFacial Expression Recognition+2

Brain-like approaches to unsupervised learning of hidden representations - a comparative study

2021-01-01 · Naresh Balaji, Anders Lansner, Pawel Herman

Unsupervised learning of hidden representations has been one of the most vibrant research directions in machine learning in recent years. In this work we study the brain-like Bayesian Confidence Propagating Neural Networ…

BIG-bench Machine Learning