On multi-view learning with additive models

Annals of Applied Statistics

Volumn 3, Issue 1, 2009, Pages 292-318

  Culp, Mark ^a,b,c   Michailidis, George ^a,b,c   Johnson, Kjell ^a,b,c  

^a WEST VIRGINIA UNIVERSITY   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c PFIZER GLOBAL RESEARCH AND DEVELOPMENT   (United States)

Author keywords

Generalized additive model; Model selection; Multi view learning; Semi supervised learning; Smoothing

Indexed keywords

EID: 80051607075     PISSN: 19326157     EISSN: 19417330     Source Type: Journal    
DOI: 10.1214/08-AOAS202     Document Type: Article

References (37)

1. Abney, S. (2002). Bootstrapping. In Association for Computational Linguistics360-367.
2. Abney, S. (2004). Understanding the Yarowsky algorithm. Comput. Linguist. 30 365-395.
3. Blum, A. and Chawla, S. (2001). Learning from labeled and unlabeled data using graph mincuts. In International Conference on Machine Learning 19-26.
4. Blum, A. and Mitchell, T. (1998). Combining labeled and unlabeled data with co-training. In Proceedings of the Eleventh Annual Conference in Computational Learning Theory (Madison WI 1998). 92100 (electronic). ACM, New York.
5. Breiman, L. (2001). Random forests. Machine Learning 45 5-32.
6. Breiman, L., Friedman, J., Olshen, R. and Stone, C. (1984). Classification and Regression Trees. Wadsworth Advanced Book and Software, Belmont, CA.
7. Buja, A., Hastie, T. and Tibshirani, R. (1989). Linear smoothers and additive models. Ann. Statist. 17 543-555.
8. Chapelle, O., Schölkopf, B. and Zien, A., eds. (2006). Semi-Supervised Learning. MIT Press, Cambridge, MA. Available at http://www.kyb.tuebingen.mpg.de/ssl-book/.
9. Chapelle, O., Sindhwani, V. and Keerthi, S. (2008). Optimization techniques for semi-supervised support vector machines. J. Machine Learning Research 9 203-233.
10. Cohen, J. (1960). A coefficient of agreement for nominal data. Education and Psychological Measurement 20 37-46.
11. Culp, M. and Michailidis, G. (2008a). An iterative algorithm for extending learners to a semi-supervised setting. J. Comput. Graph. Statist. 17 1-27.
12. Culp, M. and Michailidis, G. (2008b). Graph-based semisupervised learning. IEEE Trans. Pattern Analysis and Machine Intelligence 30 174-179.
13. Fox, S., Farr-Jones, S., Sopchak, L., Boggs, A., Wang, H., Khoury, R. and Biros, M. (1959). High-throughput screening: Update on practices and success.J. Biomolecular Screening 11 864-869.
14. Friedman, J. (1991). Multivariate adaptive regression splines (with discussion and a rejoinder by the author). Ann. Statist. 19 1-141.
15. Gould, R. (1998). Graph Theory. Benjamin/Cummings, Merlo Park, CA.
16. Hastie, T. and Tibshirani, R. (1990). Generalized Additive Models. Monographs on Statistics and Applied Probability Vol. 43. Chapman and Hall, London.
17. Hastie, T., Tibshirani, R. and Friedman, J. (2001). The Elements of Statistical Learning (Data Mining Inference and Prediction). Springer, New York.
18. Hunter, W. (1995). Rational drug design: A multidiciplinary approach. Molecular Medical Today 1 31-34.
19. Joachims, T. (2003). Transductive learning via spectral graph partitioning. InInternational Conference on Machine Learning 290-297.
20. Johnson, R. and Zhang, T. (2007). On the effectiveness of the Laplacian normalization for graph semi-supervised learning. J. Mach. Learn. Res. 81489-1517 (electronic).
21. Kakutani, S. (1941). A generalization of Brouwer's fixed point theorem. Duke Math. J. 8 457-459.
22. Kansy, M., Senner, F. and Gubemator, K. (2001). Physicoshemical high throughput screening: Parallel artificial membrane permeation assay in the description of passive absorption process. J. Medicinal Chemistry 44923-930.
23. Krishnapuram, B., Williams, D., Xue, Y., Hartemink, A., Carin, L. and Figueiredo, M. (2005). On semi-supervised classification. In Advances in NIPS 721-728.
24. Lafferty, J. and Wasserman, L. (2007). Statistical analysis of semi-supervised regression. In Advances in NIPS 801-808.
25. Leach, A. and Gillet, V., eds (2003). An Introduction to Chemoinformatics. Kluwer Academic, London.
26. De Leeuw, J. (1994). Block relaxation algorithms in statistics. In Information Systems and Data Analysis (H. H. Bock, W. Lenski and M. M. Richter, eds.) 308-325. Springer, Berlin.
27. Lundblad, R. (2004). Chemical Reagents for Protein Modification 3rd ed. CRC Press, Boca Raton, FL.
28. McCallum, A., Nigam, K., Rennie, J. and Seymore, K. (2000). Automating the construction of internet portals with machine learning. Information Retrieval J. 3 127-163.
29. Mevik, B. and Wehrens, R. (2007). The pls package: Principal component and partial least squares regression in R. J. Statist. Software 18 1-24.
30. Nabieva, E., Jim, K., Agarwal, A., Chazelle, B. and Singh, M. (2005). Whole-proteome prediction of protein function via graph-theoretic analysis of interaction map. Bioinformatics 21 302-310.
31. Neville, J. and Jensen, D. (2005). Leveraging relational autocorrelation with latent group models. In Proceedings of Multi-Relational Data Mining 49-55.
32. Vapnik, V. (1998). Statistical Learning Theory. Wiley, New York.
33. Wang, F. and Zhang, C. (2006). Label propagation through linear neighborhoods. In International Conference on Machine Learning 985-992.
34. Yamanishi, Y., Vert, J. and Kanehisa, M. (2004). Protein network inference from multiple genomic data: A supervised approach. Bioinformatics 20 363-370.
35. Zhu, X. (2005). Semi-supervised learning with graphs. Technical report, Carnegie Mellon Univ., Pittsburgh, PA.
36. Zhu, X. (2007). Semi-supervised learning literature survey. Technical report, Computer Sciences, Univ. Wisconsin-Madison.
37. Zhu, X., Ghahramani, Z. and Lafferty, J. (2003). Semi-supervised learning using Gaussian fields and harmonic functions. In International Conference on Machine Learning 912-919.