Sciweavers

825 search results - page 71 / 165
» Learning Parts-Based Representations of Data
Sort
View
ECML
2004
Springer
15 years 5 months ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
ICA
2007
Springer
15 years 6 months ago
Discovering Convolutive Speech Phones Using Sparseness and Non-negativity
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can b...
Paul D. O'Grady, Barak A. Pearlmutter
IJON
2008
116views more  IJON 2008»
14 years 12 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
ICML
2009
IEEE
16 years 20 days ago
A convex formulation for learning shared structures from multiple tasks
Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. In this paper, we consider the problem of learning shared s...
Jianhui Chen, Lei Tang, Jun Liu, Jieping Ye
UAI
1996
15 years 1 months ago
Learning Bayesian Networks with Local Structure
In this paper we examine a novel addition to the known methods for learning Bayesian networks from data that improves the quality of the learned networks. Our approach explicitly ...
Nir Friedman, Moisés Goldszmidt