Tree-Structured Infinite Sparse Factor Model

نویسندگان

  • XianXing Zhang
  • David B. Dunson
  • Lawrence Carin
چکیده

A tree-structured multiplicative gamma process (TMGP) is developed, for inferring the depth of a tree-based factor-analysis model. This new model is coupled with the nested Chinese restaurant process, to nonparametrically infer the depth and width (structure) of the tree. In addition to developing the model, theoretical properties of the TMGP are addressed, and a novel MCMC sampler is developed. The structure of the inferred tree is used to learn relationships between high-dimensional data, and the model is also applied to compressive sensing and interpolation of incomplete images.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Structured Principal Component Analysis and Model Learning for Classification and Quality Detection of Rice Grains

In scientific and commercial fields associated with modern agriculture, the categorization of different rice types and determination of its quality is very important. Various image processing algorithms are applied in recent years to detect different agricultural products. The problem of rice classification and quality detection in this paper is presented based on model learning concepts includ...

متن کامل

Building Sparse Deep Feedforward Networks using Tree Receptive Fields

Sparse connectivity is an important factor behind the success of convolutional neural networks and recurrent neural networks. In this paper, we consider the problem of learning sparse connectivity for feedforward neural networks (FNNs). The key idea is that a unit should be connected to a small number of units at the next level below that are strongly correlated. We use Chow-Liu’s algorithm to ...

متن کامل

Tree structured sparse coding on cubes

Several recent works have discussed tree structured sparse coding [8, 10, 7, 3], where N data points in R written as the d × N matrix X are approximately decomposed into the product of matrices WZ . HereW is a d×K dictionary matrix, and Z is a K×N matrix of coefficients. In tree structured sparse coding, the rows of Z correspond to nodes on a tree, and the columns of Z are encouraged to be nonz...

متن کامل

Speech emotion classification using tree-structured sparse logistic regression

The extraction and selection of acoustic features are crucial steps in the development of a system for classifying emotions in speech. Most works in the field use some kind of prosodic features, often in combination with spectral and glottal features, and select appropriate features in classifying emotions. In the methods, feature choices are mostly made regardless of existing relationships and...

متن کامل

A Structured Dictionary Learning Method for Multi-scale Sparse Representation

In this paper, we address the problem of learning multi-scale sparse representations of natural images using structured dictionaries. Dictionaries learned by traditional algorithms have two major limitations: lack of structure and fixed size. These methods treat atoms independently from each other, and do not exploit possible relationships between them. Fixed size of atoms restricts the flexibi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the ... International Conference on Machine Learning. International Conference on Machine Learning

دوره 2011  شماره 

صفحات  -

تاریخ انتشار 2011