Constructing informative priors using transfer learning

ICML 2006 - Proceedings of the 23rd International Conference on Machine Learning

Volumn 2006, Issue , 2006, Pages 713-720

  Raina, Rajat ^a   Ng, Andrew Y ^a   Koller, Daphne ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; CLASSIFICATION (OF INFORMATION); DATA REDUCTION; ERROR ANALYSIS; INFORMATION ANALYSIS; KNOWLEDGE ACQUISITION; LEARNING ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING; TEXT PROCESSING;

BAYESIAN SETTING; BINARY TEXT CLASSIFICATION; SIMPLISTIC INDEPENDENCE ASSUMPTION; TEST ERROR REDUCTION;

LEARNING SYSTEMS;

EID: 33749240383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Ando, R. K., & Zhang, T. (2005). A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research, 6, 1817-1853.
2. Baxter, J. (1997). A bayesian/information theoretic model of learning to learn via multiple task sampling. Machine Learning, 28, 7-39.
3. Ben-David, S., & Schuller, R. (2003). Exploiting task relatedness for multiple task learning. COLT.
4. Caruana, R. (1997). Multitask learning. Machine Learning, 28, 41-75.
5. Chung, F. (1997). Spectral graph theory. Regional Conference Series in Mathematics, American Mathematical Society, 92, 1-212.
6. Efron, B. (1979). Bootstrap methods: Another look at the jackknife. In The Annals of Statistics, vol. 7, 1-26.
7. Lang, K. (1995). Newsweeder: learning to filter netnews. ICML.
8. Lawrence, N. D., & Platt, J. C. (2004). Learning to learn with the informative vector machine. ICML.
9. Miller, G. A. (1995). Wordnet: A lexical database for English. Commun. ACM, 38, 39-41.
10. Ng, A. Y., Jordan, M., & Weiss, Y. (2002). On spectral clustering: Analysis and an algorithm. NIPS.
11. Nigam, K., Lafferty, J., & McCallum, A. (1999). Using maximum entropy for text classification. IJ-CAI Workshop on Machine Learning for Information Filtering.
12. Thrun, S. (1996). Is learning the n-th thing any easier than learning the first? NIPS.
13. Yu, K., Tresp, V., & Schwaighofer, A. (2005). Learning gaussian processes from multiple tasks. ICML.