Back to search

Michigan State University

Learning with structures

Abstract

dc:description

In this dissertation we discuss learning with structures, which appears frequently in both machine learning theories and applications. First we review existing structure learning algorithms, then we study several specifically interesting problems. The first problem we study is the structure learning of dynamic systems. We investigate using dynamic Bayesian networks to reconstruct functional cortical networks from the spike trains of neurons. Next we study structure learning from matrix factorization, which has been a popular research area in recent years. We propose an efficient non-negative matrix factorization algorithm which derives not only the membership assignments to the clusters but also the interaction strengths among the clusters. Following that we study the hierarchical and grouped structure in regularization. We propose a novel regularizer called group lasso which introduces competitions among variables in groups, and thus results in sparse solutions. Finally we study the sparse structure in a novel problem of online feature selection, and propose an online learning algorithm that only needs to sense a small number of attributes before the reliable decision can be made.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zhou, Yang
Contributors dc:contributor
  • Jin, Rong
  • Chan, Christina
  • Dass, Sarat
  • Tan, Pan-Ning

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
etd:502
isbn:9781124851549
isbn:1124851542
oclc:931849160
umi:3469381
local:Zhou_grad.msu_0128D_10246

Chain of custody

source
Harvested from
Michigan State University
Base URL
d.lib.msu.edu/oai
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Zhou, Yang. Learning with structures. 2010. https://doi.org/doi:10.25335/7d3w-5e54