Sciweavers

2878 search results - page 88 / 576
» Learning the Common Structure of Data
Sort
View
108
Voted
JMLR
2006
137views more  JMLR 2006»
15 years 3 months ago
Bounds for Linear Multi-Task Learning
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
Andreas Maurer
150
Voted
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
16 years 3 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
PRICAI
2004
Springer
15 years 8 months ago
Computational Methods for Identification of Human microRNA Precursors
MicroRNA (miRNA), one of non-coding RNAs (ncRNAs), regulates gene expression directly by arresting the messenger RNA (mRNA) translation, which is important for identifying putative...
Jin-Wu Nam, Wha-Jin Lee, Byoung-Tak Zhang
166
Voted
ICML
2008
IEEE
16 years 4 months ago
Discriminative parameter learning for Bayesian networks
Bayesian network classifiers have been widely used for classification problems. Given a fixed Bayesian network structure, parameters learning can take two different approaches: ge...
Jiang Su, Harry Zhang, Charles X. Ling, Stan Matwi...
109
Voted
ICASSP
2010
IEEE
15 years 3 months ago
Toward signal processing theory for graphs and non-Euclidean data
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
Benjamin A. Miller, Nadya T. Bliss, Patrick J. Wol...