208 search results - page 8 / 42 » nips 2008 |
83
Voted
NIPS
2008
14 years 11 months ago
2008
We describe a novel class of distributions, called Mondrian processes, which can be interpreted as probability distributions over kd-tree data structures. Mondrian processes are m...
NIPS
2008
14 years 11 months ago
2008
We study the problem of domain transfer for a supervised classification task in mRNA splicing. We consider a number of recent domain transfer methods from machine learning, includ...
NIPS
2008
14 years 11 months ago
2008
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
NIPS
2008
14 years 11 months ago
2008
In analogy to the PCA setting, the sparse PCA problem is often solved by iteratively alternating between two subtasks: cardinality-constrained rank-one variance maximization and m...
NIPS
2008
14 years 11 months ago
2008
Almost all successful machine learning algorithms and cognitive models require powerful representations capturing the features that are relevant to a particular problem. We draw o...