Sign up & Download
Sign in

Papers in this group

1 - 20 of 63
  1. We present a maximum margin parameter learning algorithm for Bayesian network classifiers using a conjugate gradient (CG) method for optimization. In contrast to previous approaches, we maintain the normalization constraints on the parameters of the…
  2. We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X=FG(T), we focus on algorithms in which G is restricted to containing nonnegative entries, but allowing the data matrix…
  3. This paper presents a novel Markov Chain Monte Carlo (MCMC) inference algorithm called C⁴ - Clustering with Cooperative and Competitive Constraints - for computing multiple solutions from posterior probabilities defined on graphical models. C⁴ is a…
  4. This paper introduces a novel algorithm for the nonnegative matrix factorization and completion problem, which aims to nd nonnegative matrices X and Y from a subset of entries of a nonnegative matrix M so that XY approximates M. This problem is…
  5. In this paper a constrained non-negative matrix factorization (cNMF) algorithm for recovering constituent spectra is described together with experiments demonstrating the broad utility of the approach. The algorithm is based on the NMF algorithm of…
  6. We study the problem of choosing the optimal wavelet basis with compact support for signal representation and provide a general algorithm for computing the optimal wavelet basis. We first briefly review the multiresolution property of wavelet…
  7. MOTIVATION: When working with large-scale protein interaction data, an important analysis task is the assignment of pairs of proteins to groups that correspond to higher order assemblies. Previously a common approach to this problem has been to…